Theorems · Theorem · combinatorics
SimpleGraph.completeMultipartiteGraph.colorable_of_cliqueFree
∀ {n : ℕ} {ι : Type u_4} (V : ι → Type u_5) (f : (i : ι) → V i),
(SimpleGraph.completeMultipartiteGraph V).CliqueFree n → (SimpleGraph.completeMultipartiteGraph V).Colorable (n - 1)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypeproof · cited by 7,736
- le_rflproof · cited by 1,558
- Fintype.cardproof · cited by 1,386
- Infiniteproof · cited by 352
- SimpleGraph.CliqueFreestatement and proof · cited by 70
- SimpleGraph.Colorablestatement · cited by 67
- SimpleGraph.Coloring.colorableproof · cited by 12
- SimpleGraph.completeMultipartiteGraphstatement and proof · cited by 11
- SimpleGraph.CliqueFree.monoproof · cited by 4
- SimpleGraph.Colorable.monoproof · cited by 3
- fintypeOfNotInfiniteproof · cited by 3
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsCompleteMultipartite.colorable_of_cliqueFreeproof · cited by 2