Multicolor Ramsey number $R_{4}(3)$

The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $4$ colors contains a monochromatic triangle.

Lower bound: $51$ Checked construction
Upper bound: $62$ 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 $\ge 42$ R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7. Checked construction
via $\ge 51$, multicolor-ramsey-triangle-4-lower-51
1955 $\le 66$ R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
1973-08 $\ge 51$ F.R.K. Chung, On the Ramsey numbers N(3,3,...,3;2), Discrete Mathematics 5 (1973) 317-321.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Checked construction
Certificate multicolor-ramsey-triangle-4-lower-51, submitted by daniel-munro, 2026-11-13
[construction from F.R.K. Chung, On the Ramsey numbers N(3,3,...,3;2), Discrete Mathematics 5 (1973) 317-321.]
1974-05 $\le 65$ J. Folkman, Notes on the Ramsey number N(3,3,3,3), Journal of Combinatorial Theory, Series A 16 (1974) 371-379.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
1995-06 $\le 64$ A. Sánchez-Flores, An improved upper bound for Ramsey number N(3,3,3,3;2), Discrete Mathematics 140 (1995) 281-286.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
2004 $\le 62$ 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