The tail is cut for Ramsey numbers of cubes

Discrete Mathematics

Volumn 307, Issue 2, 2007, Pages 290-292

  Shi, Lingsheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Cube; Ramsey number

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY;

BIPARTITE GRAPH; CUBES; MONOCHROMATIC SUBGRAPHS; RAMSEY NUMBER;

GRAPH THEORY;

EID: 33845275589     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.07.005     Document Type: Article

References (8)

1. Alon N., Krivelevich M., and Sudakov B. Turán numbers of bipartite graphs and related Ramsey-type questions. Combin. Probab. Comput. 12 (2003) 477-494
2. Beck J. An upper bound for diagonal Ramsey numbers. Stud. Sci. Math. Hungar. 18 (1983) 401-406
3. S.A. Burr, P. Erdös, On the magnitude of generalized Ramsey numbers for graphs, in: Infinite and Finite Sets, vol. 1, pp. 214-240, Colloq. Math. Soc. János Bolyai, 10 (1975).
4. Graham R.L., Rödl V., and Ruciński A. On graphs with linear Ramsey numbers. J. Graph Theory 35 3 (2000) 176-192
5. Graham R.L., Rödl V., and Ruciński A. On bipartite graphs with linear Ramsey numbers. Combinatorica 21 (2001) 199-209
6. Kostochka A.V., and Rödl V. On graphs with small Ramsey numbers. J. Graph Theory 37 (2001) 198-204
7. Shi L. Cube Ramsey numbers are polynomial. Random Struct. Algorithms 19 2 (2001) 99-101
8. Shi L. Linear Ramsey numbers of sparse graphs. J. Graph Theory 50 3 (2005) 175-185