Theorem SimpleGraph.isBridge_iff_adj_and_forall_cycle_not_mem

Modification history

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_cycle_not_memView on Github →
2023-12-27 05:26
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
refactor: remove `Sym2`'s global `Prod` setoid instance, use `s(x, y)` notation for unordered pairs (#8729) …
Modified SimpleGraph.isBridge_iff_adj_and_forall_cycle_not_memView on Github →
2023-05-07 05:02
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
chore: bye-bye, solo `by`s! (#3825) …
Modified SimpleGraph.isBridge_iff_adj_and_forall_cycle_not_memView 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_cycle_not_memView on Github →