Theorems · Theorem · combinatorics
SimpleGraph.ediam_eq_top_of_not_preconnected
∀ {α : Type u_1} {G : SimpleGraph α}, ¬G.Preconnected → G.ediam = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 1 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.
Cites10
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
- IsEmptyproof · cited by 759
- isEmpty_or_nonemptyproof · cited by 269
- SimpleGraph.Preconnectedstatement and proof · cited by 49
- SimpleGraph.ediamstatement · cited by 44
- IsEmpty.forall_iffproof · cited by 39
- SimpleGraph.connected_iffproof · cited by 6
- SimpleGraph.ediam_eq_top_of_not_connectedproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.preconnected_of_ediam_ne_topproof · cited by 1