Theorem SimpleGraph.Walk.IsCycle.getVert_sub_one_ne_getVert_add_one

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.Walk.IsCycle.getVert_sub_one_ne_getVert_add_oneView on Github →
2025-04-28 02:20
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(*): use the preferred spelling for `ne` (#24408)
Added SimpleGraph.Walk.IsCycle.getVert_sub_one_ne_getVert_add_oneView on Github →