ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What is the largest clique we can find if we only look at O(nlog⁡O(1)n)O(n\log^{O(1)} n) edges, but can use an arbitrary amount of time? (By modifying the greedy algorithm, we can get a clique of size 32log⁡n\frac{3}{2}\log n with high probability in time 2n2^{\sqrt{n}}, by running the greedy algorithm until n\sqrt{n} 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 kk need to be in order to find it while looking at no more than mm 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 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.