Theorems · Theorem · combinatorics
SimpleGraph.colorable_iff_exists_bdd_nat_coloring
∀ {V : Type u} {G : SimpleGraph V} (n : ℕ), G.Colorable n ↔ ∃ C, ∀ (v : V), C v < n- Cited by
- 0 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Fintype.card_finproof · cited by 270
- SimpleGraph.Colorablestatement and proof · cited by 67
- SimpleGraph.completeGraphstatement and proof · cited by 49
- SimpleGraph.Coloringstatement and proof · cited by 44
- SimpleGraph.Embeddingproof · cited by 41
- Fin.valEmbeddingproof · cited by 30
- SimpleGraph.Hom.compproof · cited by 20
- SimpleGraph.Embedding.toHomproof · cited by 17
- SimpleGraph.Coloring.validproof · cited by 11
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.