Multicolor Ramsey number $R_{3}(3)$
The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $3$ colors contains a monochromatic triangle.
Value: $17$ lower bound Checked construction upper bound 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 |
|---|---|---|---|
| 1955 | $\ge 17$ |
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] |
Checked construction
Certificate multicolor-ramsey-triangle-3-lower-17, submitted by daniel-munro, 2026-11-13 [construction from R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.] |
| 1955 | $\le 17$ |
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] |
Literature |