ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C,c>0C,c>0 be fixed constants. Let GG be an nn-vertex CC-Ramsey graph, meaning that GG has no clique or independent set of size Clog⁡nC\log n. Let kk satisfy

cn≤k≤(1−c)n,cn\le k\le (1-c)n,

and let XX be the number of edges induced by a uniformly random kk-vertex subset of GG.

Variance-based anti-concentration conjecture. For every x∈Zx\in\mathbb{Z},

Pr⁡(X=x)=O\originalleft(1Var⁡X\aftergroup\originalright).\Pr(X=x)=O\mathopen{}\mathclose\bgroup\originalleft(\frac{1}{\sqrt{\operatorname{Var} X}}\aftergroup\egroup\originalright).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.