Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.IsAcyclic.colorable_two

∀ {V : Type u_1} {G : SimpleGraph V}, G.IsAcyclic → G.Colorable 2

An acyclic graph (forest) is 2-colorable.

Defined in
Mathlib.Combinatorics.SimpleGraph.Acyclic
Cited by
2 results in Mathlib
Foundations
Depth 95 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.IsTree.colorable_two · cited by 1IsTree.colorable_twoSimpleGraph.IsAcyclic.chromaticNumber_le_two · cited by 0IsAcyclic.chromaticNumber…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Colorable · cited by 67SimpleGraph.ColorableSimpleGraph.IsAcyclic · cited by 67SimpleGraph.IsAcyclicSimpleGraph.IsAcyclic.isBipartite · cited by 1IsAcyclic.isBipartiteIsAcyclic.colorable_twoCITED BYCITES

Cites4

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.