Theorems · Theorem · combinatorics
SimpleGraph.ediam_ne_top_of_diam_ne_zero
∀ {α : Type u_1} {G : SimpleGraph α}, G.diam ≠ 0 → G.ediam ≠ ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 38 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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 and proof · cited by 3,072
- SimpleGraph.ediamstatement · cited by 44
- SimpleGraph.diamstatement and proof · cited by 15
- SimpleGraph.diam_eq_zero_of_ediam_eq_topproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.diam_eq_zero_iff_ediam_eq_topproof · cited by 1
- SimpleGraph.exists_dist_eq_diamproof · cited by 0