REVIEW 1 cited by
Ramsey graphs induce subgraphs of quadratically many sizes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
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)}.
Discussion (0). Continue with ORCID to comment.