Variance-based anti-concentration conjecture for edge counts in Ramsey graphs
Statement
Let be fixed constants. Let be an -vertex -Ramsey graph, meaning that has no clique or independent set of size . Let satisfy
and let be the number of edges induced by a uniformly random -vertex subset of .
Variance-based anti-concentration conjecture. For every ,
This would give an optimal point-probability bound in terms of the variance, as suggested by Chebyshev's inequality. The statement is presented as an interesting open direction for Ramsey graphs.
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.