Alon–Hefetz–Krivelevich–Tyomkyn quadratic-range edge-statistics conjecture
Statement
For a graph , let be the number of edges induced by a uniformly random -vertex subset, and define
with
Quadratic-range edge-statistics conjecture. For all with
we have
This is a quantitative strengthening in the dense interior range of the edge-count parameter, predicting a polynomial decay of the maximum asymptotic fraction of -vertex subsets inducing exactly edges. The supplied text does not state whether this conjecture has been resolved.
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.