Proof of `Tight inapproximability of Max Independent Set in triangle-free graphs`
groundedproofs/Lax614640Proofs/Main.lean · lax-614640
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 polynomial-cutoff randomized blow-up converts a purported triangle-free approximation into a bounded-error, polynomial-step solver for Håstad's general-graph promise gap. Håstad's hardness theorem then contradicts .