Theorems · Definition · combinatorics
SimpleGraph.ediam
{α : Type u_1} → SimpleGraph α → ℕ∞The extended diameter is the greatest distance between any two vertices, with the value ⊤ in
case the distances are not bounded above, or the graph is not connected.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 44 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.
Cites4
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
- iSupproof · cited by 2,415
- SimpleGraph.eccentproof · cited by 28
Cited by45
Results whose statement or proof uses this declaration.
- SimpleGraph.diamproof · cited by 15
- SimpleGraph.ediam_defstatement · cited by 3
- SimpleGraph.ediam_eq_top_of_not_connectedstatement and proof · cited by 3
- SimpleGraph.ediam_eq_zero_of_subsingletonstatement · cited by 3
- SimpleGraph.eccent_le_ediamstatement · cited by 2
- SimpleGraph.exists_edist_eq_ediam_of_ne_topstatement and proof · cited by 2
- SimpleGraph.connected_of_ediam_ne_topstatement and proof · cited by 2
- SimpleGraph.ediam_ne_top_of_diam_ne_zerostatement · cited by 2
- SimpleGraph.ediam_ne_zerostatement and proof · cited by 2
- SimpleGraph.ediam_topstatement · cited by 2
- SimpleGraph.edist_le_ediamstatement · cited by 2
- SimpleGraph.nontrivial_of_ediam_ne_zerostatement and proof · cited by 1