Alon–Hefetz–Krivelevich–Tyomkyn Poisson anti-concentration conjecture for graph edge statistics
Statement
Let be an -vertex graph. For , choose a uniformly random -vertex subset and let be the number of edges induced by . Suppose and grows sufficiently rapidly in terms of . For every integer with
Alon–Hefetz–Krivelevich–Tyomkyn's conjecture. One has
This conjecture seeks a Poisson-type universal upper bound, analogous to the maximum point mass of a Poisson random variable with mean one. The source gives no resolution, so the conjecture remains open.
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.