An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem

Built on

A combinatorial problem in geometry
P. Erdős and G. Szekeres · 1935
Earlier work this paper cites.
On sets of acquaintances and strangers at any party
A. W. Goodman · 1959
Earlier work this paper cites.
On the number of complete subgraphs contained in certain graphs,
P. Erdős · 1962
Earlier work this paper cites.
Graph complexity
Pavel Pudlák, Vojtěch Rödl, and Petr Savický · 1988
Earlier work this paper cites.
Quasi-random graphs
F. R. K. Chung, R. L. Graham, and R. M. Wilson · 1989
Earlier work this paper cites.
On the minimum number of k k -cliques in graphs with restricted independence number
V. Nikiforov · 2001
Earlier work this paper cites.

Sharp bounds for some multicolor Ramsey numbers
Noga Alon and Vojtěch Rödl · 2005
Cited alongside, same era.
Pseudo-random graphs
Michael Krivelevich and Benny Sudakov · 2006
Cited alongside, same era.
Flag algebras
Alexander A. Razborov · 2007
Cited alongside, same era.
On the Ramsey multiplicity of complete graphs
David Conlon · 2012
Cited alongside, same era.
A problem of Erdős on the minimum number of k k -cliques
Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, and Benny Sudakov · 2013
Cited alongside, same era.

Minimum number of k k -cliques in graphs with bounded independence number
Oleg Pikhurko and Emil R. Vaughan · 2013
Later among the works it cites.
Recent developments in graph Ramsey theory
David Conlon, Jacob Fox, and Benny Sudakov · 2015
Later among the works it cites.
Lower bounds for multicolor Ramsey numbers
David Conlon and Asaf Ferber · 2020
Later among the works it cites.
Lecture notes on multicolor Ramsey numbers
Yuval Wigderson · 2020
Later among the works it cites.
An improved lower bound on multicolor Ramsey numbers
Original
Yuval Wigderson · 2021
Closest in time.