Proof of `Multicoloured Clique Is NP-Hard` (1st statement)
groundedproofs/Lax496464Proofs/WHierarchy/MccNP/HardnessFinal.lean · lax-496464
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.
Description
Multicoloured Clique is NP-hard: Independent Set is (archive), and the reduction is polynomial-time computable, sends the word of an instance to the word of its construction, and preserves the answer.