Refuting colorability with SoS
Statement
Can constant-degree sum-of-squares refute -colorability for random graphs of average degree less than (i.e.\ below the Kesten-Stigum bound)?
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.