Theorem SimpleGraph.reachable_delete_edges_iff_exists_walk

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.reachable_delete_edges_iff_exists_walkView on Github →
2025-03-12 15:12
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(whitespace): yet some more whitespace changes (#22854) …
Modified SimpleGraph.reachable_delete_edges_iff_exists_walkView on Github →
2025-02-14 14:20
Mathlib/Combinatorics/SimpleGraph/Path.lean
feat(Combinatorics/SimpleGraph): Characterizing `SimpleGraph.IsCycles` (#20830) …
Modified SimpleGraph.reachable_delete_edges_iff_exists_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.reachable_delete_edges_iff_exists_walkView on Github →
2023-03-01 07:31
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
Port/combinatorics.simple_graph.connectivity (#2514)
Added SimpleGraph.reachable_delete_edges_iff_exists_walkView on Github →