Theorems · Theorem · combinatorics
SimpleGraph.exists_edist_eq_ediam_of_finite
∀ {α : Type u_1} {G : SimpleGraph α} [Nonempty α] [Finite α], ∃ u v, G.edist u v = G.ediam- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- Finitestatement and proof · cited by 3,029
- SimpleGraph.ediststatement · cited by 55
- SimpleGraph.ediamstatement · cited by 44
- exists_eq_ciSup_of_finiteproof · cited by 8
- SimpleGraph.ediam_defproof · cited by 3
- Prod.exists'proof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.connected_iff_ediam_ne_topproof · cited by 1