Theorem SimpleGraph.exists_isAcyclic_reachable_eq_le_of_le_of_isAcyclic

Modification history

2026-02-13 23:15
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
feat(Combinatorics/SimpleGraph/Acyclic): every graph has a spanning forest (#33118) …
Added SimpleGraph.exists_isAcyclic_reachable_eq_le_of_le_of_isAcyclicView on Github →