Proof of `The chromatic lower bound for independence number two`
groundedproofs/Lax342547Proofs/HadwigerMatching/ChromaticBound.lean · lax-342547
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A graph with independence number at most two needs at least half as many colors as vertices.