Theorem SimpleGraph.not_reachable_iff_isEmpty_walk

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.not_reachable_iff_isEmpty_walkView on Github →
2024-07-30 05:14
Mathlib/Combinatorics/SimpleGraph/Path.lean
refactor(Combinatorics/SimpleGraph): move `Walk` to its own file (#15171) …
Modified SimpleGraph.not_reachable_iff_isEmpty_walkView on Github →
2024-07-08 19:04
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
feat(Combinatorics/SimpleGraph): vertices are not reachable iff set of walks between them is empty (#14315) …
Added SimpleGraph.not_reachable_iff_isEmpty_walkView on Github →