Theorems · Definition · combinatorics
SimpleGraph.Colorable
{V : Type u} → SimpleGraph V → ℕ → PropWhether a graph can be colored by at most n colors.
- Cited by
- 67 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Coloringproof · cited by 44
Cited by70
Results whose statement or proof uses this declaration.
- SimpleGraph.chromaticNumberproof · cited by 54
- SimpleGraph.Coloring.colorablestatement · cited by 12
- SimpleGraph.Colorable.chromaticNumber_lestatement and proof · cited by 11
- SimpleGraph.IsBipartiteproof · cited by 11
- SimpleGraph.chromaticNumber_le_iff_colorablestatement and proof · cited by 10
- SimpleGraph.Colorable.chromaticNumber_eq_sInfstatement and proof · cited by 5
- SimpleGraph.colorable_zero_iffstatement and proof · cited by 4
- SimpleGraph.Colorable.of_homstatement and proof · cited by 4
- SimpleGraph.chromaticNumber_le_of_forall_impstatement and proof · cited by 4
- SimpleGraph.chromaticNumber_ne_top_iff_existsstatement and proof · cited by 4
- SimpleGraph.colorable_chromaticNumberstatement and proof · cited by 3
- SimpleGraph.Colorable.monostatement and proof · cited by 3