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

Lower bound: $101$ Literature
Upper bound: $193$ 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 $\ge 94$ S.P. Radziszowski and D.L. Kreher, Search Algorithm for Ramsey Graphs by Union of Group Orbits, Journal of Graph Theory, 12 (1988) 59-72.
[via Small Ramsey Numbers, Stanisław Radziszowski, Electronic Journal of Combinatorics Dynamic Survey DS1, revision #1, 1994-11-09]
Literature
1993 $\ge 95$ 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, revision #1, 1994-11-09]
Literature
1994 $\le 216$ T. Spencer, University of Nebraska at Omaha, personal communication (1993), and, Upper Bounds for Ramsey Numbers via Linear Programming, manuscript (1994).
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
2003 $\ge 101$ H. Harborth and S. Krause, Ramsey Numbers for Circulant Colorings, Congressus Numerantium, 161 (2003) 139-150.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Literature
2020 $\le 193$ 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.