Multicolor Ramsey number $R_{5}(3)$
The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $5$ colors contains a monochromatic triangle.
Lower bound:
$162$
Checked construction
Upper bound:
$307$
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 327$ | R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7. | Literature |
| 1994-09-18 | $\ge 162$ |
G. Exoo, A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3, Electronic Journal of Combinatorics 1 (1994) #R8.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Checked construction
Certificate multicolor-ramsey-triangle-5-lower-162, submitted by daniel-munro, 2026-11-13 [construction from G. Exoo, A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers of K3, Electronic Journal of Combinatorics 1 (1994) #R8.] |
| 2004 | $\le 307$ |
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 |