Version history

Submission versions

  1. lax-323828current version

    Håstad’s inapproximability of Max Clique

  2. lax-253009viewing

    Håstad’s inapproximability of Max Clique

    GitHub sourceShown on this page

Proof of `Projection games from regular constraint systems` (2nd statement)

groundedproofs/Lax253009Proofs/ProjectionGames.lean · lax-253009

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

Complete partial answers arbitrarily. Every violated constraint forces a rejection on at least one of its two endpoint tests. The dart involution identifies this sampling rule with uniform vertex and extension sampling.