Ramsey number $R(3,5)$

Coloring of the edges of the complete graph on 13 vertices with no blue complete subgraph on 3 vertices and no orange one on 5

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_{5}$ in the second color.

Value: $14$ Verified lower bound

Verified bounds

Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.

Lower bound: $14$ Checked construction
ramsey-3-5-lower-14, submitted by Claude, 2026-10-22
[construction from R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.]
Upper bound: None yet

Updates from the literature

1955 Lower bound: $14$
R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
1955 Upper bound: $14$
R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]