Theorem SimpleGraph.IsAcyclic.isAcyclic_sup_fromEdgeSet_of_not_reachable

Modification history

2026-04-01 13:03
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
refactor(Combinatorics/SimpleGraph): use `edge` and `deleteEdges` more (#36804) …
Deleted SimpleGraph.IsAcyclic.isAcyclic_sup_fromEdgeSet_of_not_reachableView on Github →
2026-03-01 13:37
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
feat(Combinatorics/SimpleGraph/Acyclic): acyclic and bridge theorems + golfing (#30640)
Added SimpleGraph.IsAcyclic.isAcyclic_sup_fromEdgeSet_of_not_reachableView on Github →