Theorems · Theorem · combinatorics
SimpleGraph.edist_eq_top_of_not_reachable
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V}, ¬G.Reachable u v → G.edist u v = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 34 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.
- Top.topstatement and proof · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Reachablestatement and proof · cited by 141
- SimpleGraph.ediststatement · cited by 55
- ENat.iInf_eq_top_of_isEmptyproof · cited by 2
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_eq_top_of_not_connectedproof · cited by 3
- SimpleGraph.reachable_of_edist_ne_topproof · cited by 2
- SimpleGraph.eccent_eq_top_of_not_connectedproof · cited by 2
- SimpleGraph.edist_antiproof · cited by 1