Lax Lean Archive

Version history

Submission versions

  1. lax-222097current version

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

    Created Lean v4.33.0mathlib db584cd6d46c92f209a44c0f1c829460d327499d
    GitHub sourceOpen version
  2. lax-762056viewing

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

    Created Lean v4.33.0mathlib db584cd6d46c92f209a44c0f1c829460d327499d
    GitHub sourceShown on this page

Proof of `Induced grid exclusion in the reduction`

groundedproofs/Lax762056Proofs/GridExclusion.lean · lax-762056

What this proof establishes

lem✓Lax762056.GridExclusion

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

Induced-minor exclusion passes to induced subgraphs.