Low degree sum-of-squares bounds for the stability number: a copositive approach

Luis Felipe Vargas, Juan C. Vera, Peter J. C. Dickinson

The stability number of a graph $G$, denoted as $\hat{I}\pm (G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lo…