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)}.
Ramsey graphs induce subgraphs of quadratically many sizes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain "richness" properties characteristic of random graphs. Motivated by an old problem of Erd\H{o}s and McKay, recently Narayanan, Sahasrabudhe and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of $\Theta(n^2)$ different sizes. In this paper we prove this conjecture.
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)}.