The Induced Size-Ramsey Number of Cycles

Combinatorics, Probability and Computing

Volumn 4, Issue 3, 1995, Pages 217-239

  Haxell, P E ^a   Kohayakawa, Y ^b   Luczak T ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c INSTITUTE OF MATHEMATICS   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974117199     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548300001619     Document Type: Article

References (23)

1. Alon N. and Spencer J. H. (1992) The Probabilistic Method. Wiley, New York.
2. Beck J. (1983) On size Ramsey number of paths, trees and circuits I. J. Graph Theory 7, 115–129.
3. Beck J. (1990) On size Ramsey number of paths, trees and circuits II. Mathematics of Ramsey Theory (Nešetřil J. and Rödl V., eds.), Springer-Verlag, Berlin, 34–45.
4. Beck J. (1983) An upper bound for diagonal Ramsey numbers. Studia Sci. Math. Hung. 18, 401–406.
5. Bollobás B. (1985) Random Graphs. Academic Press, London.
6. Bollobás B. (1992) Personal communication.
7. Chen G. and Schelp R. H. (1993) Graphs with linearly bounded Ramsey numbers. J. Combinatorial Theory (B) 57, 138–149.
8. Chvátal V., Rödl V., Szemerédi E. and Trotter W. T. (1983) The Ramsey number of a graph with bounded degree. J. Combinatorial Theory (B) 34, 239–243.
9. Deuber W. (1975) A generalization of Ramsey'y theorem. Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai 10 (Hajnal A., Rado R. and Sós V. T., eds.), North Holland, Amsterdam, 323–332.
10. Erdős P., Faudree R. J., Rousseau C. C. and Schelp R. H. (1978) The size Ramsey number. Periodica Math. Hungar. 9, 145–161.
11. Erdős P., Hajnal A. and Pósa L. (1975) Strong embeddings of graphs into colored graphs. Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai 10, (Hajnal A., Rado R. and Sós V. T., eds.), North Holland, Amsterdam, 585–595.
12. Erdős P. and Rousseau C. C. (1993) The size Ramsey number of a complete bipartite graph. Discrete Math. 113, 259–262.
13. Graham R. L. and Rödl V. (1987) Numbers in Ramsey theory. Surveys in Combinatorics, London Mathematical Society Lecture Note Series 123 (Whitehead C., ed.), Cambridge University Press, Cambridge, 111–153.
14. Haxell P. E. and Kohayakawa Y. (1995) The size-Ramsey number of trees. Israel J. Math. 89, 261–274.
15. Hoeffding W. (1963) Probability inequalities for sums of bounded random variables. J. Am. Statistical Assoc. 58, 13–30.
16. Ke X. (1993) The size Ramsey number of trees with bounded degree. Random Structures and Algorithms 4, 85–97.
17. Kohayakawa Y. (1993) The regularity lemma of Szeméredi for sparse graphs. Manuscript.
18. Luczak T. (1993) The size of the largest hole in a random graph. Discrete Math. 112, 151–163.
19. McDiarmid C. J. H. (1989) On the method of bounded differences. Surveys in Combinatorics 1989, London Mathematical Society Lecture Notes Series 141 (Siemons J., ed.), Cambridge University Press, Cambridge, 148–188.
20. Rödl V. (1973) The dimension of a graph and generalized Ramsey theorems. Thesis, Charles University, Praha.
21. Rödl V. (1993) Personal communication.
22. Szemerédi E. (1978) Regular partitions of graphs. Problèmes en Combinatoire et Théorie des Graphes, Proc. Colloque Inter. CNRS (Bermond J.-C., Fournier J.-C., Las Vergnas M. and Sotteau D., eds.), CNRS, Paris, 399–401.
23. Turán P. (1941) On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452. (in Hungarian)