Multicolor Ramsey number $R_{8}(3)$

The smallest number $n$ such that any coloring of the edges of the complete graph $K_n$ with $8$ colors contains a monochromatic triangle.

Lower bound: $5384$ Checked construction
Upper bound: $102882$ (102,882) 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.