Ramsey number $R(3,13)$

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_{13}$ in the second color.

Lower bound: $61$ Checked construction
Upper bound: $68$ 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
1966-01 $\ge 58$ J.G. Kalbfleisch, Chromatic Graphs and Ramsey's Theorem, Ph.D. thesis, University of Waterloo, January 1966.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #1, 1994-11-09]
Checked construction
Certificate ramsey-3-13-lower-58, submitted by daniel-munro, 2026-11-02
1988 $\le 69$ 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 59$ K. Piwakowski, paper presented at the conference "System-Modeling-Control", Zakopane, Poland (1993).
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, original version, 1994-08-01]
Checked construction
via $\ge 61$, ramsey-3-13-lower-61
2013 $\le 68$ J. Goedgebeur and S.P. Radziszowski, New Computational Upper Bounds for Ramsey Numbers R(3, k), Electronic Journal of Combinatorics, http://www.combinatorics.org, #P30, 20(1) (2013), 28 pages.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
2015 $\ge 60$ 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
via $\ge 61$, ramsey-3-13-lower-61
2026-02-12 $\ge 61$ Google Research, ramsey_number_bounds: improved lower bounds on Ramsey numbers, GitHub repository, 2026.
[via A. Nagda, P. Raghavan and A. Thakurta, Reinforced Generation of Combinatorial Structures: Ramsey Numbers, arXiv:2603.09172 (2026).]
Checked construction
Certificate ramsey-3-13-lower-61, 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.