Theorem SimpleGraph.Walk.IsTrail.isEdgeReachable_two_of_isEdgeReachable_two

Modification history

2026-04-01 17:01
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean
feat(Combinatorics/SimpleGraph): hamiltonian graphs don't contain bridges (#36802) …
Added SimpleGraph.Walk.IsTrail.isEdgeReachable_two_of_isEdgeReachable_twoView on Github →