OpenAlex ·
An Improved Upper Bound for Multicolour Ramsey Numbers
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.04596
- Original
- Read it at the publisher
- Topics
Abstract
Let $R_r(k)$ denote the diagonal $r$-colour Ramsey number. We prove that there exist absolute constants $c,K>0$ such that $R_r(k)\le r^{rk}\exp\!\left(-c\frac{k}{r\log^2(2r)}\right)$ for every $r\ge2$ and every $k\ge Kr^2\log^6(2r)$. This improves the exponential saving in a recent bound of Yang and Mao by a factor of order $r\log^2(2r)$. The proof proceeds through an off-diagonal bound, which asymptotically improves the classical multinomial bound throughout a neighbourhood of the diagonal.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Integral Dependence over One-Sided Ideals, Part I: Foundations and Classical Applications
Local Jacquet-Shalika integrals and modifying factors
Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth
Cone upgrade for effective equidistribution and weighted Khintchine--Schmidt theorem on fractals
Automorphism Groups of Smooth Cubic Fourfolds through Lattice Theory
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.