An exponential improvement for diagonal Ramsey

F.P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. , 30

1930

Earlier work this paper cites.

P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compos. Math. , 2

1935

Earlier work this paper cites.

P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. , 53

1947

Earlier work this paper cites.

J. Spencer, Asymptotic lower bounds for Ramsey functions, Discrete Math. , 20

1977

Earlier work this paper cites.

M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory, Ser. A , 29

1980

Earlier work this paper cites.

J.B. Shearer, A note on the independence number of triangle-free graphs, Discrete Math. , 46

1983

Earlier work this paper cites.

R.L. Graham and V. Rödl, Numbers in Ramsey theory, Surveys in Combinatorics, London Math. Soc. Lecture Note Series, 123

1987

Earlier work this paper cites.

A. Thomason, An upper bound for some Ramsey numbers, J. Graph Theory , 12

1988

Earlier work this paper cites.

R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey theory, Vol. 20. John Wiley & Sons, 1991

1991

Cited alongside, same era.

J.H. Kim, The Ramsey number R ⁡ ( 3 , t ) R(3,t) has order of magnitude t 2 / log ⁡ t t^{2}/\log t , Random Structures Algorithms , 7

1995

Cited alongside, same era.

M. Krivelevich and B. Sudakov, Pseudo-random graphs, In: More Sets, Graphs and Numbers: A Salute to Vera Sós and András Hajnal (E. Győri, G.O.H. Katona and L. Lovász, eds.), Bolyai Society Mathematical Studies, 15, Springer, 2006, 199–262

2006

Cited alongside, same era.

T. Bohman, The triangle-free process, Adv. Math. , 221

2009

Cited alongside, same era.

D. Conlon, A new upper bound for diagonal Ramsey numbers, Ann. Math. , 170

2009

Cited alongside, same era.

D. Conlon, The Ramsey number of books, Adv. Combin. , 2019:3, 12pp

2019

Later among the works it cites.

G. Fiz Pontiveros, S. Griffiths and R. Morris, The triangle-free process and the Ramsey numbers R ⁡ ( 3 , k ) R(3,k) , Mem. Amer. Math. Soc. , 263

2020

Later among the works it cites.

T. Bohman and P. Keevash, Dynamic Concentration of the Triangle-Free Process, Random Structures Algorithms , 58

2021

Later among the works it cites.

D. Conlon, J. Fox and Y. Wigderson, Ramsey numbers of books and quasirandomness, Combinatorica , 42

2022

Later among the works it cites.

D. Conlon, J. Fox and Y. Wigderson, Off-diagonal book Ramsey numbers, Combin. Probab. Computing , 32

2023

Closest in time.

A. Sah, Diagonal Ramsey via effective quasirandomness, Duke Math. J. , 172