Theorems · Theorem · combinatorics
SimpleGraph.diam_eq_one
∀ {α : Type u_1} {G : SimpleGraph α} [Nontrivial α], G.diam = 1 ↔ G = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 67 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.
Cites10
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
- ENatproof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- Nat.cast_oneproof · cited by 2,501
- Nontrivialstatement and proof · cited by 2,416
- one_ne_zeroproof · cited by 885
- SimpleGraph.ediamproof · cited by 44
- SimpleGraph.diamstatement · cited by 15
- ENat.toNat_eq_iffproof · cited by 4
- SimpleGraph.ediam_eq_oneproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.