Ramsey number $R(4,8)$

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

Lower bound: $59$ Checked construction
Upper bound: $79$ 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
1989 $\ge 53$ G. Exoo, Applying Optimization Algorithm to Ramsey Problems, in Graph Theory, Combinatorics, Algorithms, and Applications (Y. Alavi ed.), SIAM Philadelphia, (1989) 175-179.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #1, 1994-11-09]
Checked construction
via $\ge 59$, ramsey-4-8-lower-59
1994 $\le 84$ J. Mackey, Combinatorial Remedies, Ph.D. thesis, Department of Mathematics, University of Hawaii, 1994.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
1998-05-14 $\ge 55$ 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 59$, ramsey-4-8-lower-59
2002 $\ge 56$ G. Exoo, Some Applications of pq-groups in Graph Theory, preprint (2002), constructions available at http://isu.indstate.edu/ge/RAMSEY.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #9, 2002-07-15]
Checked construction
via $\ge 59$, ramsey-4-8-lower-59
2013 $\ge 58$ G. Exoo, On Some Small Classical Ramsey Numbers, Electronic Journal of Combinatorics, http://www.combinatorics.org, #P68, 20(1) (2013), 6 pages.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #14, 2014-01-12]
Checked construction
via $\ge 59$, ramsey-4-8-lower-59
2015 $\ge 59$ G. Exoo and M. Tatarevic, New Lower Bounds for 28 Classical Ramsey Numbers, Electronic Journal of Combinatorics, http:// www.combinatorics.org, #P3.11, 22(3) (2015), 12 pages. Graphs available at the journal site and at http://cs.indstate.edu/ge/RAMSEY/ExTa.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Checked construction
Certificate ramsey-4-8-lower-59, submitted by daniel-munro, 2026-11-14
[construction from G. Exoo and M. Tatarevic, New Lower Bounds for 28 Classical Ramsey Numbers, Electronic Journal of Combinatorics, http:// www.combinatorics.org, #P3.11, 22(3) (2015), 12 pages. Graphs available at the journal site and at http://cs.indstate.edu/ge/RAMSEY/ExTa.]
2020 $\le 79$ V. Angeltveit and B.D. McKay, personal communication (2019-2024).
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature

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.