The sixth Schur number is at least 538
We give an explicit partition of {1, ..., 538} into six sum-free sets. This shows S(6) ≥ 538 and improves the bound S(6) ≥ 537 of Chen, Zhu and Long. It also gives R_6(3) ≥ 540 for the Ramsey number of the triangle in six colours, and known recursive constructions give S(8) ≥ 5382, S(11) ≥ 204588 and S(13) ≥ 2045882. The partition is checked directly and in Lean 4. The paper is paper/schur-six-538.pdf in this archive.
Authors
- Adam McKenna
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-04
- DOI
- https://doi.org/10.5281/zenodo.23937655
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint