Multicolor Ramsey number $R_{9}(3)$
The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $9$ colors contains a monochromatic triangle.
Lower bound:
$17805$
(17,805)
Literature
Upper bound:
$925931$
(925,931)
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 | $\le 986411$ (986,411) | R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7. | Literature |
| 2004 | $\le 925931$ (925,931) |
S. Fettes, R.L. Kramer and S.P. Radziszowski, An Upper Bound of 62 on the Classical Ramsey Number R(3,3,3,3), Ars Combinatoria 72 (2004) 41-63.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Literature |
| 2019-12-03 | $\ge 17696$ (17,696) | F. Rowley, A generalised linear Ramsey graph construction, Australasian Journal of Combinatorics 81 (2021) 245-256, arXiv:1912.01164. |
Checked construction
via $\ge 17762$, multicolor-ramsey-triangle-9-lower-17762 |
| 2021-12-06 | $\ge 17805$ (17,805) |
R. Ageron, P. Casteras, T. Pellerin, Y. Portella, A. Rimmel and J. Tomasik, New lower bounds for Schur and weak Schur numbers, arXiv:2112.03175.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24] |
Literature |