Complexity of Maximum Cut on Interval Graphs

Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee +1

We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.