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 `Clique number equals the maximum number of accepting random choices` (2nd statement)

groundedproofs/Lax253009Proofs/ConsistencyGraph.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

Choose one accepting local view for each accepting random choice. All the chosen views extend the given proof, so they are pairwise compatible.