Lower bounds for multicolor Ramsey numbers
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.
© 2020 Elsevier Inc. Received 24 September 2020, Revised 25 November 2020, Accepted 26 November 2020, Available online 9 December 2020. Research supported in part by NSF grants DMS-1954395 and DMS-1953799. We are extremely grateful to Vishesh Jain and Wojciech Samotij for reading an early draft of this paper and offering several suggestions which improved the presentation. We also owe a debt to Noga Alon and Anurag Bishnoi, both of whom pointed out the constraint on the dimension of isotropic subspaces, thereby improving the bound in our original posting.
Submitted - 2009.10458.pdf