On graphs with small ramsey numbers

Journal of Graph Theory

Volumn 37, Issue 4, 2001, Pages 198-204

  Kostochka, A V ^a,b   Rodl V ^c  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

Bipartite graphs; Ramsey numbers

Indexed keywords

EID: 31244432561     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.1014     Document Type: Article

References (6)

1. N. Alon, Subdivided graphs have linear Ramsey numbers, J Graph Theory 18(4) (1984), 343-347.
2. S. A. Burr and P. Erdös, On the magnitude of generalized Ramsey numbers for graphs, in: "Infinite and finite sets", Vol.1, Colloquia Mathematica Soc. Janos Bolyai, 10, North-Holland, Amsterdam-London (1975), 214-240.
3. G. Chen and R. H. Schelp, Graphs with linearly bounded Ramsey numbers, J Comb Theory, Ser. B 57 (1993), 138-149.
4. C. Chvátal, V. Rödl, E. Szemerédi, and W. T. Trotter, The Ramsey number of a graph with bounded maximum degree, J Comb Theory, Ser. B 34 (1983), 239-243.
5. V. Rödl and R. Thomas, Arrangeability and clique subdivisions, in: "The Mathematics of Paul Erdös", Vol. 2, R. Graham and J. Nešetřil, (Editors), Springer, Berlin, 1997, pp. 236-239.
6. S. Lingsheng, manuscript, March 30, 2001.