Multicolor Ramsey number $R_{7}(3)$
The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $7$ colors contains a monochromatic triangle.
Lower bound:
$1698$
Checked construction
Upper bound:
$12861$
(12,861)
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 13701$
(13,701)
|
R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Canadian Journal of Mathematics, 7 (1955) 1-7.
|
Literature
|
| 2000-05-18 |
$\ge 1682$
|
H. Fredricksen and M.M. Sweet, Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers, Electronic Journal of Combinatorics 7 (2000) #R32.
|
Checked construction
via $\ge 1698$, multicolor-ramsey-triangle-7-lower-1698
|
| 2004 |
$\le 12861$
(12,861)
|
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
|
| 2021-07-08 |
$\ge 1698$
|
F. Rowley, An Improved Lower Bound for S(7) and Some Interesting Templates, arXiv:2107.03560.
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]
|
Checked construction
Certificate multicolor-ramsey-triangle-7-lower-1698,
submitted by daniel-munro, 2026-11-13
[construction from F. Rowley, An Improved Lower Bound for S(7) and Some Interesting Templates, arXiv:2107.03560.]
|