no. 11 · Monday 9 November 2026
An upper bound of 60 for the Ramsey number R(3,3,3,3)
Abstract
We improve the upper bound on the classical Ramsey number $R(3,3,3,3)$ from 62 to 60. The proof is based on a global incidence count, classifications of small neighborhoods and exhaustive SAT computations. We formalize the mathematical reductions in Lean and refute every resulting formula with two SAT solvers.
- comments
- 15 pages, 3 figures. This revision improves the upper bound from 61 to 60
- fields
- Combinatorics