Metraipolis › archive › dc_cf52f7afefb6

Lower bounds for Ramsey numbers: $\mathrm{R}(6,8)\ge 135$ and $\mathrm{R}(8,10)\ge 345$ — arXiv:2610.12122

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.12122
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:11.349Z
SHA-256 of the archived text
66096cd8dbbf136493f315d0a8cd19d00fb6c64da6777238aec5974f34622879
Stable URL of this page
https://metraipolis.com/documento/dc_cf52f7afefb6

How to cite

Lower bounds for Ramsey numbers: $\mathrm{R}(6,8)\ge 135$ and $\mathrm{R}(8,10)\ge 345$ — arXiv:2610.12122 — arXiv (en), https://arxiv.org/abs/2610.12122 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf52f7afefb6 (Metraipolis archive dc_cf52f7afefb6, sha256 66096cd8dbbf136493f315d0a8cd19d00fb6c64da6777238aec5974f34622879)
BibTeX
@misc{dccf52f7afefb6,
  title = {Lower bounds for Ramsey numbers: $mathrmR(6,8)ge 135$ and $mathrmR(8,10)ge 345$ — arXiv:2610.12122},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.12122},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf52f7afefb6; sha256 66096cd8dbbf136493f315d0a8cd19d00fb6c64da6777238aec5974f34622879},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.12122. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove the lower bounds $\mathrm{R}(6,8)\ge 135$ and $\mathrm{R}(8,10)\ge 345$, improving the bounds 134 and 343 listed in the April 2026 revision of Radziszowski's dynamic survey. We give explicit red/blue colorings of $K_{134}$ with no red $K_6$ or blue $K_8$, and of $K_{344}$ with no red $K_8$ or blue $K_{10}$, and verify them with two independently written exhaustive clique checkers. Starting from published colorings, we find these witnesses by adding vertices and repairing the resulting monochromatic cliques through local search. The search uses exact conflict counts, preparation moves aimed at making remaining cliques cheaper to break, and mutations followed by repair. A loss based on the largest monochromatic clique containing each edge yielded a useful intermediate state for the $\mathrm{R}(6,8)$ construction. Guided by the author, an AI coding agent wrote and ran the search code; we describe the methods and document the ancestry of the resulting colorings.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2610.12122 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.297Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).