Theorems · Theorem · combinatorics
SimpleGraph.eccent_eq_top_of_not_connected
∀ {α : Type u_1} {G : SimpleGraph α}, ¬G.Connected → ∀ (u : α), G.eccent u = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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 and proof · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- eq_top_iffproof · cited by 236
- le_iSupproof · cited by 207
- SimpleGraph.Reachableproof · cited by 141
- SimpleGraph.Connectedstatement and proof · cited by 75
- SimpleGraph.edistproof · cited by 55
- SimpleGraph.eccentstatement and proof · cited by 28
- SimpleGraph.connected_iff_exists_forall_reachableproof · cited by 6
- SimpleGraph.edist_eq_top_of_not_reachableproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.radius_eq_top_of_not_connectedproof · cited by 2
- SimpleGraph.eccent_botproof · cited by 1