Theorems · Theorem · combinatorics
SimpleGraph.ediam_eq_zero_of_subsingleton
∀ {α : Type u_1} {G : SimpleGraph α} [Subsingleton α], G.ediam = 0- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 40 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Subsingleton
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
- SimpleGraph.ediamstatement · cited by 44
- SimpleGraph.ediam_defproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_eq_zero_iff_subsingletonproof · cited by 1
- SimpleGraph.nontrivial_of_ediam_ne_zeroproof · cited by 1
- SimpleGraph.diam_botproof · cited by 0