Theorems · Theorem · combinatorics
SimpleGraph.diam_def
∀ {α : Type u_1} {G : SimpleGraph α}, G.diam = (⨆ p, G.edist p.1 p.2).toNat- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 37 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
- ENat.toNatstatement and proof · cited by 143
- SimpleGraph.ediststatement and proof · cited by 55
- SimpleGraph.diamstatement · cited by 15
- SimpleGraph.ediam_defproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.