Theorems · Theorem · combinatorics
SimpleGraph.completeMultipartiteGraph.chromaticNumber
∀ {ι : Type u_4} (V : ι → Type u_5) [inst : Fintype ι] (f : (i : ι) → V i),
(SimpleGraph.completeMultipartiteGraph V).chromaticNumber = ↑(Fintype.card ι)- Cited by
- 0 results in Mathlib
- Foundations
- Depth 99 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
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.
- Fintypestatement and proof · cited by 7,736
- ENatstatement · cited by 4,985
- le_antisymmproof · cited by 2,068
- le_rflproof · cited by 1,558
- Fintype.cardstatement and proof · cited by 1,386
- SimpleGraph.chromaticNumberstatement and proof · cited by 54
- SimpleGraph.completeMultipartiteGraphstatement and proof · cited by 11
- SimpleGraph.Colorable.chromaticNumber_leproof · cited by 11
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardproof · cited by 3
- SimpleGraph.cliqueFree_of_chromaticNumber_ltproof · cited by 1
- SimpleGraph.completeMultipartiteGraph.colorableproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.