Ramsey number $R(3,13)$
The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{3}$ in the first color or a monochromatic $K_{13}$ in the second color.
Lower bound:
$61$
Checked construction
Upper bound:
$68$
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.
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 86$: ramsey-3-13-upper-86, submitted by daniel-munro, 2026-11-11 Weaker than recorded