On size Ramsey numbers of graphs with bounded degree

Combinatorica

Volumn 20, Issue 2, 2000, Pages 257-262

  Rödl, Vojtěch ^a   Szemerédi, Endre ^b  

^a EMORY UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034360544     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070024     Document Type: Article

References (6)

1. J. BECK: On size Ramsey number of paths, trees and circuits I, J. Graph Theory, 7 (1983), 115-129.
2. J. BECK: On Size Ramsey Number of Paths, Trees and Circuits II, in: Mathematics of Ramsey Theory (J. Nesětřil and V. Rödl eds.), 34-45, Springer-Verlag, 1990.
3. P. ERDOS: On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25-42.
4. P. ERDOS, R. J. FAUDREE, C. C. ROUSSEAU and R. H. SCHELP: The size Ramsey number, Period. Math. Hungar., 9 (1978), 145-161.
5. J. FRIEDMAN and N. PIPPENGER: Expanding graphs contain all small trees, Combinatorica, 7 (1981), 71-76.
6. P. E. HAXELL, Y. KOHAYAHAWA and T. LUCZAK: The induced size-Ramsey number of cycles, Combin. Probab. Comput., 4 (1995), 217-239.