ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For the random graph G(n,p)G(n,p), the largest clique has asymptotic size 2log⁡1/pn2\log_{1/p} n, whereas the best stated constructive algorithm (Greedy) produces only a clique of size log⁡1/pn\log_{1/p} n. The factor-22 gap between the optimum and the efficiently constructible value remains open, as posed as a challenge by Karp in 1976.

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.