Theorem SimpleGraph.isBridge_iff_adj_and_forall_walk_mem_edges

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_adj_and_forall_walk_mem_edgesView on Github →
2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.isBridge_iff_adj_and_forall_walk_mem_edgesView on Github →
2024-07-30 05:14
Mathlib/Combinatorics/SimpleGraph/Path.lean
refactor(Combinatorics/SimpleGraph): move `Walk` to its own file (#15171) …
Modified SimpleGraph.isBridge_iff_adj_and_forall_walk_mem_edgesView on Github →
2023-03-01 07:31
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
Port/combinatorics.simple_graph.connectivity (#2514)
Added SimpleGraph.isBridge_iff_adj_and_forall_walk_mem_edgesView on Github →