Theorems · Theorem · combinatorics
SimpleGraph.exists_dist_eq_diam
∀ {α : Type u_1} {G : SimpleGraph α} [Nonempty α], ∃ u v, G.dist u v = G.diam- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- ENat.toNatproof · cited by 143
- SimpleGraph.Reachableproof · cited by 141
- SimpleGraph.edistproof · cited by 55
- SimpleGraph.ediamproof · cited by 44
- SimpleGraph.diststatement and proof · cited by 40
- SimpleGraph.diamstatement and proof · cited by 15
- SimpleGraph.exists_edist_eq_ediam_of_ne_topproof · cited by 2
- SimpleGraph.ediam_ne_top_of_diam_ne_zeroproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.