Theorems · Theorem · combinatorics
SimpleGraph.dist_le_diam
∀ {α : Type u_1} {G : SimpleGraph α}, G.ediam ≠ ⊤ → ∀ {u v : α}, G.dist u v ≤ G.diam- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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.ediamstatement and proof · cited by 44
- SimpleGraph.diststatement · cited by 40
- SimpleGraph.diamstatement · cited by 15
- ENat.toNat_le_toNatproof · cited by 6
- SimpleGraph.edist_le_ediamproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.diam_ne_zero_of_ediam_ne_topproof · cited by 1