Theorems · Theorem · combinatorics
SimpleGraph.diam_eq_zero
∀ {α : Type u_1} {G : SimpleGraph α}, G.diam = 0 ↔ G.ediam = ⊤ ∨ Subsingleton α- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 43 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.diamstatement · cited by 15
- ENat.toNat_eq_zeroproof · cited by 4
- SimpleGraph.ediam_eq_zero_iff_subsingletonproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.