Theorem SimpleGraph.isEdgeConnected_two

Modification history

2026-10-15 17:18
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean
feat(Combinatorics/SimpleGraph/Connectivity): simple graph is 2-edge-connected iff it has no bridge (#42839) …
Deleted SimpleGraph.isEdgeConnected_twoView on Github →
2026-01-27 07:48
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean
feat(Combinatorics/SimpleGraph): more about two-reachability (#33335)
Modified SimpleGraph.isEdgeConnected_twoView on Github →
2025-12-26 18:30
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean
feat(Combinatorics/SimpleGraph): define edge-connectivity (#32870) …
Added SimpleGraph.isEdgeConnected_twoView on Github →