Closing the factor-two algorithmic gap for maximum cliques in random graphs
Statement
For the random graph , the largest clique has asymptotic size , whereas the best stated constructive algorithm (Greedy) produces only a clique of size . The factor- 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.