Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.pathGraph.bicoloring

(n : ℕ) → (SimpleGraph.pathGraph n).Coloring Bool

Bicoloring of a path graph

Defined in
Mathlib.Combinatorics.SimpleGraph.Coloring.Constructions
Cited by
1 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.chromaticNumber_pathGraph · cited by 0SimpleGraph.chromaticNumb…SimpleGraph.Coloring · cited by 44SimpleGraph.ColoringSimpleGraph.pathGraph · cited by 8SimpleGraph.pathGraphSimpleGraph.Coloring.mk · cited by 3Coloring.mkpathGraph.bicoloringCITED BYCITES

Cites3

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

Cited by1

Results whose statement or proof uses this declaration.