Multicolor Ramsey number $R_{8}(3)$
The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $8$ colors contains a monochromatic triangle.
Lower bound:
$5384$
Checked construction
Upper bound:
$102882$
(102,882)
Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| 1955 | $\le 109602$ (109,602) | R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7. | Literature |
| 2004 | $\le 102882$ (102,882) |
S. Fettes, R.L. Kramer and S.P. Radziszowski, An Upper Bound of 62 on the Classical Ramsey Number R(3,3,3,3), Ars Combinatoria 72 (2004) 41-63.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Literature |
| 2019-12-03 | $\ge 5288$ |
F. Rowley, A generalised linear Ramsey graph construction, Australasian Journal of Combinatorics 81 (2021) 245-256, arXiv:1912.01164.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Checked construction
via $\ge 5384$, multicolor-ramsey-triangle-8-lower-5384 |
| 2026-11-13 | $\ge 5384$ | Certificate multicolor-ramsey-triangle-8-lower-5384, submitted by daniel-munro |
Checked construction
[construction from A. McKenna, The sixth Schur number is at least 538, Zenodo.] |