Journal article icon

Journal article

Upper bounds for multicolour Ramsey numbers

Abstract:

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$, that \[ R_r(k) \leqslant e^{-\delta k_r} r^k \] for some constant $\delta = \delta(r) > 0$ and all sufficiently large $k \in \mathbb{N}$. For each $r \geqslant 3$, this is the first exponential improvement over the upper bound of Erd\H{o}s and Szekeres from 1935. In the case $r = 2$, it gives a different (and significantly shorter) proof of a recent result of Campos, Griffiths, Morris and Sahasrabudhe [Ann. Math., To appear].

Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1090/jams/1069

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Wadham College
Role:
Author
ORCID:
0000-0003-2696-0352
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author


More from this funder
Funder identifier:
https://ror.org/050q5pk40
Grant:
R-2412-51283
More from this funder
Funder identifier:
https://ror.org/0472cxd90
Grant:
R-2412-51283
More from this funder
Funder identifier:
https://ror.org/03swz6y49
Grant:
R-2412-51283


Publisher:
American Mathematical Society
Journal:
Journal of the American Mathematical Society More from this journal
Volume:
39
Issue:
3
Pages:
765-780
Publication date:
2026-01-16
DOI:
EISSN:
1088-6834
ISSN:
0894-0347


Language:
English
Pubs id:
2367202
Local pid:
pubs:2367202
Deposit date:
2026-04-15
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP