Bounding independent set size with SoS
Statement
For a random graph of average degree , what upper bound can constant-degree sum-of-squares prove on the size of an independent set. It is conjectured that the answer is (for some constant ) even though the true size of the largest independent set is .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.