Theorem SimpleGraph.Walk.exists_mem_edges_of_not_reachable_deleteEdges

Modification history

2025-11-16 07:52
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
feat: removing leaves from a connected graph keeps it connected (#31103) …
Added SimpleGraph.Walk.exists_mem_edges_of_not_reachable_deleteEdgesView on Github →