# Lovasz theta is *really* good

Patrick’s INP “survey” function currently tests graphs with minimum degree at least 3 and maximum degree no more than n-2 (graphs with $\delta<3$ or $\Delta=n-1$ are reducible). These are the graphs reported on below.

sage: INPGraph.survey(INPGraph.lovasz_theta, 9)
Counting graphs of order 9… 76783
Testing…
69941 out of 76783 graphs of order 9 were predicted by lovasz_theta.