On induced Ramsey numbers for graphs with bounded maximum degree

Journal of Combinatorial Theory. Series B

Volumn 66, Issue 2, 1996, Pages 324-333

  Łuczak, Tomasz ^a,b   Rödl, Vojtěch ^a  

^a EMORY UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030101217     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0025     Document Type: Article

References (13)

1. 1. J. BECK, An upper bound for diagonal Ramsey numbers, Studia Sci. Math. Hungar. 18 (1983), 401-406.
2. 2. J. BECK, On size Ramsey number of paths, trees and circuits II, in "Mathematics of Ramsey Theory" (J. Nešetřil and V. Rödl, Eds.) pp. 34-35, Springer-Verlag, Berlin, 1990.
3. 3. J. I. BROWN AND V. RÖDL, A Ramsey type problem concerning vertex colourings, J. Combin. Theory Ser. B 52 (1991), 45-52.
4. 4. S. A. BURR AND P. ERDÖS, On the magnitude of generalized Ramsey numbers for graphs, in "Infinite and Finite Sets," Colloq. Math. Soc. J. Bolyai, Vol. 10 (A. Hajnal, R. Rado, and V. Sós, Eds,), pp. 214-240, North-Holland, Amsterdam, 1975.
5. 5. G. CHEN AND R. H. SHELP, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993), 138-149.
6. 6. V. CHVÁTAL, V. RÖDL, E. SZEMERÉDI, W. T. TROTTER, The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), 239-243.
7. 7. W. DEUBER, A generalization of Ramsey's theorem, in "Infinite and Finite Sets," Colloq. Math. Soc. J. Bolyai, Vol. 10 (A. Hajnal, R. Rado, and V. Sós, Eds.), pp. 323-332, North-Holland, Amsterdam, 1975.
8. 8. N. EATON AND V. RÖDL, A canonical Ramsey theorem, Random Structures Algorithms 3 (1992), 427-444.
9. 9. P. ERDÖS, A. HAJNAL, AND L. PÓSA, Strong embeddings of graphs into colored graphs, in "Infinite and Finite Sets," Colloq. Math. Soc. J. Bolyai, Vol. 10 (A. Hajnal, R. Rado, and V. Sós, Eds.), pp. 585-595, North-Holland, Amsterdam, 1975.
10. 10. P. E. HAXELL, Y. KOHAYAKAWA, AND T. ŁUCZAK, The induced size-Ramsey number of cycles, Combinatorics, Probab. Comput. 4 (1995), 217-240.
11. 11. C. J. H. MCDIARMID, On the method of bounded differences, in "Surveys in Combinatorics 1989," London Mathematical Society Lecture Notes Series, Vol. 141 (J. Siemons, Ed.), pp. 148-188, Cambridge Univ. Press, Cambridge, 1989.
12. 12. V. RÖDL, "A Generalization of Ramsey Theorem," pp. 211-220, Charles University 1973; see also "Graphs, Hypergraphs and Block Systems," thesis, Zielona Góra, 1976.
13. 12. V. RÖDL, "A Generalization of Ramsey Theorem," pp. 211-220, Charles University 1973; see also "Graphs, Hypergraphs and Block Systems," thesis, Zielona Góra, 1976.