ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is there a polynomial time algorithm that is able to find the largest clique of GG (with high probability) for ω≪n\omega \ll \sqrt{n} ? For example, for ω≈nlog⁡n\omega \approx \frac{\sqrt{n}}{\log n} ? Is there a polynomial time algorithm that is able to distinguish, with high probability, GG from a draw of G(n,12)G\left( n, \frac12\right) for ω≪n\omega \ll \sqrt{n} ? For example, for ω≈nlog⁡n\omega \approx \frac{\sqrt{n}}{\log n} ? Is there a quasi-linear time algorithm able to find the largest clique of GG (with high probability) for ω≤(1e−ϵ)n\omega\leq \left(\frac1{\sqrt{e}}-\epsilon \right)\sqrt{n} , for some ϵ>0\epsilon>0 ? (This question was posed here )

Record

Added
Links

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.