English

New upper bound for multicolor Ramsey numbers

Combinatorics 2026-08-03 v1

Abstract

Let Rr(k)R_r(k) denote the diagonal rr-color graph Ramsey number. We prove that there exist absolute constants c,K>0c,K>0 such that Rr(k)exp ⁣(ckr2log4(2r))rrk R_r(k)\le \exp\!\left(-c\frac{k}{r^2\log^4(2r)}\right)r^{rk} for every r2r\ge2 and every kKr2log6(2r)k\ge Kr^2\log^6(2r). The proof combines a positive-coefficient root filter of variable order with a retained-spine refinement of the multicolor book method.b

Cite

@article{arxiv.2608.01962,
  title  = {New upper bound for multicolor Ramsey numbers},
  author = {Gang Yang and Yaping Mao},
  journal= {arXiv preprint arXiv:2608.01962},
  year   = {2026}
}