Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming

Charles Carlson, Alexandra Kolla, Ray Li +3

For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history…