Theorems · Theorem · combinatorics
SimpleGraph.ediam_ne_zero
∀ {α : Type u_1} {G : SimpleGraph α} [Nontrivial α], G.ediam ≠ 0- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 40 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nontrivial
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
- Nontrivialstatement and proof · cited by 2,416
- SimpleGraph.ediamstatement and proof · cited by 44
- exists_pair_neproof · cited by 32
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.subsingleton_of_ediam_eq_zeroproof · cited by 1
- SimpleGraph.ediam_ne_zero_iff_nontrivialproof · cited by 0