Péter Maga: New lower bounds for multicolor Ramsey numbers - after Conlon and Ferber

Abstract:

Following a recent preprint of Conlon and Ferber, we prove new lower bounds on the diagonal Ramsey numbers R(n,...,n) (where the number of n's is a fixed t>2), which improves exponentially on the bound t^{n/2} proved by random methods going back to Erdős. Ingredients involve a construction based on number theory and random methods.

For Zoom access please contact Andras Biro (biro.andras[a]renyi.hu).