Theorems · Theorem · combinatorics
SimpleGraph.eccent_eq_one_iff
∀ {α : Type u_1} {G : SimpleGraph α} [Nontrivial α] (u : α), G.eccent u = 1 ↔ ∀ (v : α), u ≠ v → G.Adj u v- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 43 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nontrivial
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.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- Nontrivialstatement and proof · cited by 2,416
- SimpleGraph.Adjstatement and proof · cited by 1,346
- LE.le.ge_iff_eq'proof · cited by 50
- Order.one_le_iff_ne_zeroproof · cited by 32
- SimpleGraph.eccentstatement and proof · cited by 28
- SimpleGraph.eccent_ne_zeroproof · cited by 5
- SimpleGraph.eccent_le_one_iffproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.