Theorem SimpleGraph.IsBridge.sup_fromEdgeSet_of_not_reachable_of_isBridge

Modification history

2026-04-01 13:03
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
refactor(Combinatorics/SimpleGraph): use `edge` and `deleteEdges` more (#36804) …
Deleted SimpleGraph.IsBridge.sup_fromEdgeSet_of_not_reachable_of_isBridgeView on Github →
2026-03-01 13:37
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
feat(Combinatorics/SimpleGraph/Acyclic): acyclic and bridge theorems + golfing (#30640)
Added SimpleGraph.IsBridge.sup_fromEdgeSet_of_not_reachable_of_isBridgeView on Github →