Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.Colorable.mono

∀ {V : Type u} {G : SimpleGraph V} {n m : ℕ}, n ≤ m → G.Colorable n → G.Colorable m
Defined in
Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
Cited by
3 results in Mathlib
Foundations
Depth 68 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.chromaticNumber_le_iff_colorable · cited by 10SimpleGraph.chromaticNumb…SimpleGraph.completeMultipartiteGraph.colorable_of_cliqueFree · cited by 1completeMultipartiteGraph…SimpleGraph.partitionable_iff_colorable · cited by 0SimpleGraph.partitionable…DFunLike.coe · cited by 62936DFunLike.coeSimpleGraph · cited by 3072SimpleGraphNonempty.some · cited by 340Nonempty.someFintype.card_fin · cited by 270Fintype.card_finSimpleGraph.Colorable · cited by 67SimpleGraph.ColorableSimpleGraph.recolorOfCardLE · cited by 4SimpleGraph.recolorOfCard…Colorable.monoCITED BYCITES

Cites6

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

Cited by3

Results whose statement or proof uses this declaration.