REVIEW 7 cited by
An exponential improvement for diagonal Ramsey
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
abstract
The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 - \varepsilon)^k \] for some constant $\varepsilon > 0$. This is the first exponential improvement over the upper bound of Erd\H{o}s and Szekeres, proved in 1935.
Forward citations
Cited by 7 Pith papers
-
Ramsey numbers of trees
Every n-vertex tree with maximum degree at most cn has Ramsey number max{t1 + 2t2, 2t1} - 1, where t1 >= t2 are the sizes of its bipartition classes.
-
Polynomial-to-exponential transition in 3-uniform Ramsey numbers
For every fixed s > 3, the 3-uniform Ramsey number r_3(s, g_3(s)+1; t) is at least 2^{c t^{2/3}} for some c > 0, settling the last open case of the 1972 Erdős-Hajnal conjecture.
-
Size-Ramsey numbers of tight paths
For every fixed r and s, the minimum number of edges in a host hypergraph that forces a monochromatic r-uniform tight path on n vertices under any s-colouring grows only linearly in n.
-
On the clique number of random Cayley graphs and related topics
Random Cayley graphs on any group of order N have clique number O(log N log log N) with high probability, giving near-optimal Ramsey and self-complementary Cayley graphs.
-
Monochromatic odd cycles in edge-coloured complete graphs
Every q-edge-colouring of K_{2^q+1} contains a monochromatic odd cycle of length O(2^q/q^{1-o(1)}), the first bound of the form o(2^q).
-
Ramsey numbers of sparse graphs versus disjoint books
For any large connected sparse graph G on n vertices, the Ramsey number r(G,tB_k) equals 2n+t-2, extending the tree-book result to all sparse graphs.
-
A Survey on Ordered Ramsey Numbers
A survey of ordered Ramsey numbers for graphs and hypergraphs, summarizing recent bounds and listing open problems.
Discussion (0). Continue with ORCID to comment.