Sharp Hardness for MAX-3-CUT

Assuming the Unique Games Conjecture, it is NP-hard to approximate MAX-3-CUT better than the Frieze-Jerrum semidefinite program does, and similarly for Quantum MAX-CUT: the sharpness question in the Khot-Kindler-Mossel-O'Donnell line, connected to the Plurality is Stablest problem.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Jul 31, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-assisted. Imported under CC BY 4.0.

Canonical aliases: Sharp Hardness for MAX-3-CUT · MAX-3-CUT hardness

Confidence: Not scored

Registry verification: unreviewed · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Steven Heilman
human · human collaborator

ChatGPT 5.6
model · ai model contributor · OpenAI

Lineage and corrections

This event attributed to Steven Heilman

This event attributed to ChatGPT 5.6

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem