Indexed metadata
An upper bound of 61 for the Ramsey number
Milos Tatarevic
Source abstract
We improve the upper bound on the classical Ramsey number 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.