An improved lower bound on multicolor Ramsey numbers
- 22 March 2021
- journal article
- research article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 149 (6) , 2371-2374
Abstract
A recent breakthrough of Conlon and Ferber yielded an exponential improvement on the lower bounds for multicolor diagonal Ramsey numbers. In this note, we modify their construction and obtain improved bounds for more than three colors.Keywords
All Related Versions
Funding Information
- National Science Foundation (DGE-1656518)
This publication has 9 references indexed in Scilit:
- Lower bounds for multicolor Ramsey numbersAdvances in Mathematics, 2021
- Multicolor Ramsey Numbers via Pseudorandom GraphsThe Electronic Journal of Combinatorics, 2020
- Lovász, Vectors, Graphs and Codes2019
- A new upper bound for diagonal Ramsey numbersAnnals of Mathematics, 2009
- Sharp Bounds For Some Multicolor Ramsey NumbersCombinatorica, 2005
- I. Schur, C.E. Shannon and Ramsey Numbers, a short storyDiscrete Mathematics, 2001
- Ramsey's theorem—A new lower boundJournal of Combinatorial Theory, Series A, 1975
- On Subsets with Intersections of Even CardinalityCanadian Mathematical Bulletin, 1969
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947