On exactness of SDP relaxation for the maximum cut problem
Abstract
Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. For a graph with rational weights, the decision problem of whether the SDP relaxation for the maximum cut problem is exact is known to be -hard; however its complexity was unresolved for unweighted graphs. In this work, we extend the -hardness result to unweighted graphs. We characterize a few classes of graphs for which the SDP relaxation is exact. For each of these graph classes, we establish conditions for uniqueness of the SDP optimum. We complement these findings by identifying two graph operations that preserve the solution rank, and in turn exactness. These results reveal how the SDP relaxation for the maximum cut problem can remain exact in arbitrarily large graphs, owing to the presence of a small structural core that governs exactness. We further address two open problems posed by Mirka and Williamson (2024), by demonstrating that uniqueness of the maximum cut partition in exact relaxation does not imply uniqueness of the SDP optimum, and that exact relaxation with multiple optimal partitions may admit optimal SDP solutions lying outside the convex hull of rank-1 reference solutions.
Cite
@article{arxiv.2505.05200,
title = {On exactness of SDP relaxation for the maximum cut problem},
author = {Avinash Bhardwaj and Hritiz Gogoi and Vishnu Narayanan and Abhishek Pathapati},
journal= {arXiv preprint arXiv:2505.05200},
year = {2026}
}