Theorems · Theorem · combinatorics
SimpleGraph.chromaticNumber_pathGraph
∀ (n : ℕ), 2 ≤ n → (SimpleGraph.pathGraph n).chromaticNumber = 2
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement · cited by 4,985
- zero_addproof · cited by 2,366
- le_antisymmproof · cited by 2,068
- Fintype.cardproof · cited by 1,386
- SimpleGraph.Adjproof · cited by 1,346
- SimpleGraph.Colorableproof · cited by 67
- SimpleGraph.chromaticNumberstatement · cited by 54
- SimpleGraph.Coloring.colorableproof · cited by 12
- SimpleGraph.Colorable.chromaticNumber_leproof · cited by 11
- SimpleGraph.pathGraphstatement and proof · cited by 8
- SimpleGraph.two_le_chromaticNumber_of_adjproof · cited by 3
- SimpleGraph.pathGraph.bicoloringproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.