Theorems · Theorem · combinatorics
SimpleGraph.radius_le_ediam
∀ {α : Type u_1} {G : SimpleGraph α} [Nonempty α], G.radius ≤ G.ediam- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.ediamstatement · cited by 44
- SimpleGraph.radiusstatement · cited by 20
- iInf_le_iSupproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_eq_top_iff_radius_eq_topproof · cited by 1