Theorems · Definition · combinatorics
SimpleGraph.diam
{α : Type u_1} → SimpleGraph α → ℕThe diameter is the greatest distance between any two vertices, with the value 0 in
case the distances are not bounded above, or the graph is not connected.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- ENat.toNatproof · cited by 143
- SimpleGraph.ediamproof · cited by 44
Cited by15
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_ne_top_of_diam_ne_zerostatement and proof · cited by 2
- SimpleGraph.diam_eq_zero_iff_ediam_eq_topstatement · cited by 1
- SimpleGraph.diam_eq_zero_of_ediam_eq_topstatement · cited by 1
- SimpleGraph.diam_ne_zero_of_ediam_ne_topstatement and proof · cited by 1
- SimpleGraph.dist_le_diamstatement · cited by 1
- SimpleGraph.nontrivial_of_diam_ne_zerostatement and proof · cited by 0
- SimpleGraph.diam_anti_of_ediam_ne_topstatement · cited by 0
- SimpleGraph.diam_botstatement · cited by 0
- SimpleGraph.diam_defstatement · cited by 0
- SimpleGraph.diam_eq_onestatement · cited by 0
- SimpleGraph.diam_eq_zerostatement · cited by 0
- SimpleGraph.diam_eq_zero_of_not_connectedstatement · cited by 0