Ramsey number $R(8,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_{8}$ in the first color or a monochromatic $K_{8}$ in the second color.

Lower bound: $282$ Checked construction
Upper bound: $1518$ 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
1972 $\ge 282$ J.P. Burling and S.W. Reyner, Some Lower Bounds of the Ramsey Numbers n(k, k), Journal of Combinatorial Theory, Series B, 13 (1972) 168-169.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Checked construction
Certificate ramsey-8-8-lower-282, submitted by daniel-munro, 2026-11-02
[construction from J.P. Burling and S.W. Reyner, Some Lower Bounds of the Ramsey Numbers n(k, k), Journal of Combinatorial Theory, Series B, 13 (1972) 168-169.]
1994 $\le 1870$ 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
2020 $\le 1518$ 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.