New Upper Bounds for the Classical Ramsey Numbers $R(4,4,4)$, $R(3,4,5)$ and $R(3,3,6)$

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Boza, Luis
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914390054273024
author Boza, Luis
author_facet Boza, Luis
contents The inequality \[ R(k_1,\ldots,k_r)\le 2-r+\sum_{i=1}^r R(k_1,\ldots,k_{i-1},k_i-1,k_{i+1},\ldots,k_r) \] is well known, and it is strict whenever the right-hand side and at least one of the terms in the sum are even. Except for two known cases, the best upper bounds for classical Ramsey numbers with at least three colors have so far been obtained from this inequality. In this paper we present new bounds such as $R(4,4,4)\le 229$, $R(3,4,5)\le 157$ and $R(3,3,6)\le 91$.
format Preprint
id arxiv_https___arxiv_org_abs_2603_10851
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle New Upper Bounds for the Classical Ramsey Numbers $R(4,4,4)$, $R(3,4,5)$ and $R(3,3,6)$
Boza, Luis
Combinatorics
The inequality \[ R(k_1,\ldots,k_r)\le 2-r+\sum_{i=1}^r R(k_1,\ldots,k_{i-1},k_i-1,k_{i+1},\ldots,k_r) \] is well known, and it is strict whenever the right-hand side and at least one of the terms in the sum are even. Except for two known cases, the best upper bounds for classical Ramsey numbers with at least three colors have so far been obtained from this inequality. In this paper we present new bounds such as $R(4,4,4)\le 229$, $R(3,4,5)\le 157$ and $R(3,3,6)\le 91$.
title New Upper Bounds for the Classical Ramsey Numbers $R(4,4,4)$, $R(3,4,5)$ and $R(3,3,6)$
topic Combinatorics
url https://arxiv.org/abs/2603.10851