Theorem SimpleGraph.isBridge_iff_mem_and_forall_cycle_notMem

Modification history

2026-06-05 15:27
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
refactor(SimpleGraph): change bridges not to require the edge to be present (#32583) …
Deleted SimpleGraph.isBridge_iff_mem_and_forall_cycle_notMemView on Github →
2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.isBridge_iff_mem_and_forall_cycle_notMemView on Github →
2025-05-25 12:30
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(*): not_mem/nmem -> notMem (#25159)
Added SimpleGraph.isBridge_iff_mem_and_forall_cycle_notMemView on Github →