A Direct Proof of Optimal Max-Cut Hardness
For every fixed with , it is NP-hard to approximate Max-Cut within a factor of on simple unweighted graphs.
The reduction from Theorem 1.2 via Lemma B.1 is complete and preserves the gap up to , which is chosen small enough to separate the YES and NO cases under an -approximation.
“Theorem 1.1. For every fixed α with αGW < α ≤ 1, it is NP-hard to approximate Max-Cut within a factor of α. This holds for simple unweighted graphs.” · Show in paper