Theorem SimpleGraph.Walk.IsCycle.getVert_sub_one_neq_getVert_add_one

Modification history

2025-04-28 02:20
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(*): use the preferred spelling for `ne` (#24408)
Deleted SimpleGraph.Walk.IsCycle.getVert_sub_one_neq_getVert_add_oneView on Github →
2025-01-16 12:28
Mathlib/Combinatorics/SimpleGraph/Path.lean
feat(Combinatorics/SimpleGraph): vertices in cycles (#20602) …
Added SimpleGraph.Walk.IsCycle.getVert_sub_one_neq_getVert_add_oneView on Github →