If a quadratic Bernoulli polynomial has a point probability much larger than 1/n, it is close to a quadratic form of low rank; a consequence bounds edge-count point probabilities in Ramsey graphs by n^{-1+o(1)}.
The edge-statistics conjecture for $\ell \ll k^{6/5}$
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a recent result of Kwan, Sudakov, and Tran, this settles a conjecture of Alon, Hefetz, Krivelevich, and Tyomkyn.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2019 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
If a quadratic Bernoulli polynomial has a point probability much larger than 1/n, it is close to a quadratic form of low rank; a consequence bounds edge-count point probabilities in Ramsey graphs by n^{-1+o(1)}.