The planted dense subgraph recovery conjecture
Statement
Let , where the planted support has size . Exact recovery means outputting the planted support. If and
the planted dense subgraph recovery conjecture. No polynomial-time algorithm can achieve exact recovery asymptotically.
The conjecture concerns the computational threshold for recovering the planted dense subgraph, which is asserted to be substantially stronger than the threshold for detection. The surrounding discussion attributes this conjectured threshold to prior work, but the supplied text gives no resolution.
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.