Theorems · Theorem · combinatorics
SimpleGraph.ediam_top
∀ {α : Type u_1} [Nontrivial α], ⊤.ediam = 1- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 65 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement · cited by 3,072
- Nontrivialstatement and proof · cited by 2,416
- iSupproof · cited by 2,415
- SimpleGraph.ediamstatement · cited by 44
- ciSup_constproof · cited by 43
- SimpleGraph.eccent_topproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_eq_oneproof · cited by 1
- SimpleGraph.diam_topproof · cited by 0