Theorems · Theorem · combinatorics
SimpleGraph.ediam_def
∀ {α : Type u_1} {G : SimpleGraph α}, G.ediam = ⨆ p, G.edist p.1 p.2- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 36 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.
- ENatstatement and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- iSupstatement and proof · cited by 2,415
- SimpleGraph.ediststatement and proof · cited by 55
- SimpleGraph.ediamstatement · cited by 44
- iSup_prodproof · cited by 10
- SimpleGraph.eccent_defproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_eq_zero_of_subsingletonproof · cited by 3
- SimpleGraph.exists_edist_eq_ediam_of_finiteproof · cited by 1
- SimpleGraph.diam_defproof · cited by 0