An improved lower bound on multicolor Ramsey numbers
Yuval Wigderson

TL;DR
This paper enhances the lower bounds for multicolor Ramsey numbers beyond three colors by modifying recent constructions, advancing understanding of these combinatorial quantities.
Contribution
It introduces a modified construction that improves lower bounds for multicolor Ramsey numbers with more than three colors.
Findings
Improved lower bounds for multicolor Ramsey numbers with more than three colors.
Extension of recent exponential lower bound improvements to additional color cases.
Methodological advancement in combinatorial construction techniques.
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.
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.
