Proof of `Coloring, chromatic number and clique cover` (8th statement)

groundedproofs/Lax799700Proofs/Bridge/Coloring.lean · lax-799700

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Membership from the library's existential second-order definition of kk-colorability; hardness by padding the reduction of 3-colorability to kk-colorability with k−3k - 3 further colors, 3-colorability being NP-hard by the catalog's statement for it.