Version history

Submission versions

  1. lax-222097current version

    Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

  2. lax-762056viewing

    Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

    GitHub sourceShown on this page

Proof of `Independent Set without a 5×5 induced grid minor`

groundedproofs/Lax762056Proofs/IndependentSetHardness.lean · lax-762056

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

In the paper

  • page 3 of this submission's paper

Description

Compose the reduction from Max Cut with the graph construction. Exclusion of the induced grid minor gives the target class. The independence-number identity gives equivalence after shifting the threshold.