Ramsey number $R(7,7)$

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

Lower bound: $205$ Checked construction
Upper bound: $492$ 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
1987 $\ge 205$ R. Mathon, Lower Bounds for Ramsey Numbers and Association Schemes, Journal of Combinatorial Theory, Series B, 42 (1987) 122-127.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
Checked construction
Certificate ramsey-7-7-lower-205, submitted by daniel-munro, 2026-11-02
[construction from R. Mathon, Lower Bounds for Ramsey Numbers and Association Schemes, Journal of Combinatorial Theory, Series B, 42 (1987) 122-127.]
1994 $\le 540$ 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 492$ 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.