$R(5,5)\le 46$
Vigleik Angeltveit, Brendan D. McKay

TL;DR
This paper establishes an upper bound of 46 for the Ramsey number R(5,5) using a combination of linear programming and extensive computer case checking, confirming the bound through independent implementations.
Contribution
It provides a new upper bound for R(5,5) and demonstrates a computational approach with independent verification for mathematical proof.
Findings
R(5,5) ≤ 46 established
Computational methods verified independently
Combination of linear programming and case analysis used
Abstract
We prove that the Ramsey number is less than or equal to~. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computations were independently implemented by both authors, with consistent results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research
