Proof of `Multicoloured Clique Is NP-Hard` (2nd 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
The same, and the word produced is always the word of an instance: it is the word of the construction on an instance of Independent Set, which encodes the multicoloured graph.