Theorems · Definition · combinatorics
SimpleGraph.IsEdgeReachable
{V : Type u_1} → SimpleGraph V → ℕ → V → V → PropTwo vertices are k-edge-reachable if they remain reachable after removing strictly fewer than
k edges.
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Sym2proof · cited by 737
- Set.encardproof · cited by 327
- SimpleGraph.Reachableproof · cited by 141
- SimpleGraph.deleteEdgesproof · cited by 64
Cited by25
Results whose statement or proof uses this declaration.
- SimpleGraph.IsEdgeConnectedproof · cited by 8
- SimpleGraph.IsEdgeReachable.reachablestatement and proof · cited by 3
- SimpleGraph.IsEdgeReachable.antistatement and proof · cited by 2
- SimpleGraph.IsEdgeReachable.rflstatement · cited by 2
- SimpleGraph.IsEdgeReachable.symmstatement and proof · cited by 2
- SimpleGraph.isBridge_iff_not_isEdgeReachable_twostatement and proof · cited by 2
- SimpleGraph.isEdgeReachable_onestatement · cited by 2
- SimpleGraph.exists_adj_isEdgeReachable_twostatement and proof · cited by 1
- SimpleGraph.exists_isCycle_of_two_le_isEdgeReachablestatement and proof · cited by 1
- SimpleGraph.IsEdgeReachable.le_degreestatement and proof · cited by 1
- SimpleGraph.IsEdgeReachable.of_subsingletonstatement · cited by 1
- SimpleGraph.IsEdgeReachable.transstatement and proof · cited by 1