A remark on the Ramsey number of the hypercube

S. A. Burr and P. Erdős, On the magnitude of generalized Ramsey numbers for graphs, in Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I

1973

Earlier work this paper cites.

J. Beck, An upper bound for diagonal Ramsey numbers, Studia Sci. Math. Hungar. 18

1983

Earlier work this paper cites.

W. T. Gowers, A new proof of Szemerédi’s theorem for arithmetic progressions of length four, Geom. Funct. Anal. 8

1998

Earlier work this paper cites.

R. L. Graham, V. Rödl and A. Ruciński, On graphs with linear Ramsey numbers, J. Graph Theory 35

2000

Earlier work this paper cites.

R. L. Graham, V. Rödl and A. Ruciński, On bipartite graphs with linear Ramsey numbers, Combinatorica 21

2001

Earlier work this paper cites.

A. V. Kostochka and V. Rödl, On graphs with small Ramsey numbers, J. Graph Theory 37

2001

Cited alongside, same era.

L. Shi, Cube Ramsey numbers are polynomial, Random Structures Algorithms 19

2001

Cited alongside, same era.

N. Alon, M. Krivelevich and B. Sudakov, Turán numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput. 12

2003

Cited alongside, same era.

B. Sudakov, A few remarks on Ramsey-Turán-type problems, J. Combin. Theory Ser. B 88

2003

Cited alongside, same era.

L. Shi, The tail is cut for Ramsey numbers of cubes, Discrete Math. 307

2007

Cited alongside, same era.

J. Fox and B. Sudakov, Density theorems for bipartite graphs and related Ramsey-type results, Combinatorica 29

2009

Later among the works it cites.

J. Fox and B. Sudakov, Dependent random choice, Random Structures Algorithms 38

2011

Later among the works it cites.

D. Conlon, J. Fox and B. Sudakov, Short proofs of some extremal results II, J. Combin. Theory Ser. B 121

2016

Later among the works it cites.

C. Lee, Ramsey numbers of degenerate graphs, Ann. of Math. (2) 185

2017

Later among the works it cites.