Ramsey number $R(3,12)$

The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{3}$ in the first color or a monochromatic $K_{12}$ in the second color.

Lower bound: $53$ Checked construction
Upper bound: $59$ 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
1988 $\le 60$ S.P. Radziszowski and D.L. Kreher, Upper Bounds for Some Ramsey Numbers R(3, k), Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 207-212.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #1, 1994-11-09]
Literature
1993 $\ge 51$ G. Exoo, Announcement: On the Ramsey Numbers R(4,6), R(5,6) and R(3,12), Ars Combinatoria, 35 (1993) 85.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #1, 1994-11-09]
Checked construction
via $\ge 53$, ramsey-3-12-lower-53
1998-05-14 $\ge 52$ G. Exoo, Some New Ramsey Colorings, Electronic Journal of Combinatorics, 5 (1998) #R29.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #5, 1998-07-09]
Checked construction
via $\ge 53$, ramsey-3-12-lower-53
2001 $\le 59$ A. Lesser, Theoretical and Computational Aspects of Ramsey Theory, Examensarbeten i Matematik, Matematiska Institutionen, Stockholms Universitet, 3, http://www2.math.su.se/gemensamt/grund/exjobb/matte/2001 (2001).
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
2015 $\ge 53$ M. Kolodyazhny, Novye Nizhnie Granitsy Chisel Ramseya R(3, 12) i R(3, 13) (in Russian), Matematicheskoye i Informacionnoe Modelirovanie, Tyumen, 14 (2015) 126-130.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Checked construction
Certificate ramsey-3-12-lower-53, submitted by daniel-munro, 2026-11-14
[construction from Google Research, ramsey_number_bounds: improved lower bounds on Ramsey numbers, GitHub repository, 2026.]

Other certificates

Certificates that aren't the best evidence for any bound above: other certificates are stronger evidence for the same bounds, or they prove only bounds weaker than any recorded.