Lower bounds for multicolor Ramsey numbers
David Conlon, Asaf Ferber
TL;DR
This paper presents an exponential improvement in the lower bounds of diagonal multicolor Ramsey numbers for any fixed number of colors greater than two, advancing understanding of these combinatorial quantities.
Contribution
It introduces a new method that significantly improves the known lower bounds for multicolor Ramsey numbers with more than two colors.
Findings
Exponential lower bounds for multicolor Ramsey numbers.
Applicable to any fixed number of colors greater than two.
Advances theoretical understanding of Ramsey number growth.
Abstract
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.