ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a random graph of average degree dd, what upper bound can constant-degree sum-of-squares prove on the size of an independent set. It is conjectured that the answer is Cn/dC n/\sqrt{d} (for some constant CC) even though the true size of the largest independent set is ndlog⁡d\frac{n}{d} \log d.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.