Year: 2026
Type: preprint
Abstract: We improve the upper bound on the classical Ramsey number $R(3,3,3,3)$ from 62 to 61. 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.
Source: arXiv (Cornell University)
Author: Tatarevic, Milos
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7224136849
