Theorem SimpleGraph.IsAcyclic.sup_edge_of_not_reachable

Modification history

2026-04-01 13:03
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
refactor(Combinatorics/SimpleGraph): use `edge` and `deleteEdges` more (#36804) …
Added SimpleGraph.IsAcyclic.sup_edge_of_not_reachableView on Github →