Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Colorable.mono_left

∀ {V : Type u} {G G' : SimpleGraph V}, G ≤ G' → ∀ {n : ℕ}, G'.Colorable n → G.Colorable n
Defined in
Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
Cited by
2 results in Mathlib
Foundations
Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.colorable_of_cliqueFree_lt_minDegree · cited by 0SimpleGraph.colorable_of_…SimpleGraph.chromaticNumber_mono · cited by 0SimpleGraph.chromaticNumb…SimpleGraph · cited by 3072SimpleGraphNonempty.some · cited by 340Nonempty.someSimpleGraph.Colorable · cited by 67SimpleGraph.ColorableSimpleGraph.Hom.ofLE · cited by 27Hom.ofLESimpleGraph.Hom.comp · cited by 20Hom.compColorable.mono_leftCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.