Proof of `The independence number records the maximum cut`
groundedproofs/Lax762056Proofs/IndependenceIdentity.lean · lax-762056
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 5 of this submission's paper
Description
Every independent set induces a cut, with at most the stated number of vertices in each edge's two rows. Conversely, the explicit construction from a maximum cut realizes the bound, including the additional vertex for each crossing edge.