Planted clique with bounded edge queries
Statement
What is the largest clique we can find if we only look at edges, but can use an arbitrary amount of time? (By modifying the greedy algorithm, we can get a clique of size with high probability in time , by running the greedy algorithm until unexamined vertices remain, then brute-forcing over them to find the larges clique).
Alternatively, consider the planted version: how large does the planted clique size need to be in order to find it while looking at no more than edges?
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.