Ramsey number $R(8,14)$
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_{14}$ in the second color.
Lower bound:
$454$
Checked construction
Upper bound:
$41525$
(41,525)
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 |
|---|---|---|---|
| 2007 | $\le 41525$ (41,525) |
Huang Yi Ru, Wang Yuandi, Sheng Wancheng, Yang Jiansheng, Zhang Ke Min and Huang Jian, New Upper Bound Formulas with Parameters for Ramsey Numbers, Discrete Mathematics, 307 (2007) 760-763.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Literature |
| 2026-11-11 | $\ge 454$ | Certificate ramsey-8-14-lower-454, submitted by daniel-munro | Checked construction |
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.
- $\le 69218$: ramsey-8-14-upper-69218, submitted by daniel-munro, 2026-11-11 Weaker than recorded