Theorem SimpleGraph.Walk.IsCycle.three_le_length

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.Walk.IsCycle.three_le_lengthView on Github →
2024-07-30 05:14
Mathlib/Combinatorics/SimpleGraph/Path.lean
refactor(Combinatorics/SimpleGraph): move `Walk` to its own file (#15171) …
Modified SimpleGraph.Walk.IsCycle.three_le_lengthView on Github →
2024-03-26 15:23
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
feat(Combinatorics/SimpleGraph): Cycles length is at least 3 (#11693) …
Added SimpleGraph.Walk.IsCycle.three_le_lengthView on Github →