Alon–Hefetz–Krivelevich–Tyomkyn superlinear sparsity conjecture
Statement
For an -vertex graph , let be the number of edges induced by a uniformly random -vertex subset of . Define
and
Alon–Hefetz–Krivelevich–Tyomkyn's superlinear sparsity conjecture. For all satisfying
we have
This predicts asymptotic anticoncentration whenever both the number of induced edges and the number of nonedges grow superlinearly in . Its status is not resolved in the supplied text.
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.