Theorem SimpleGraph.Walk.bypass_eq_self_of_length_le

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.Walk.bypass_eq_self_of_length_leView 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.bypass_eq_self_of_length_leView on Github →
2024-04-17 15:12
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
feat(Combinatorics/SimpleGraph): Existence of a path from `u` to `v` of length equal to `G.dist u v` (#11814) …
Added SimpleGraph.Walk.bypass_eq_self_of_length_leView on Github →