The 3-colored Ramsey number of even cycles

Journal of Combinatorial Theory. Series B

Volumn 99, Issue 4, 2009, Pages 690-708

  Benevides, Fabricio Siqueira ^a,b   Skokan, Jozef ^c,d  

^a UNIVERSITY OF MEMPHIS   (United States)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c LONDON SCHOOL OF ECONOMICS   (United Kingdom)

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

Author keywords

Cycles; Ramsey number; Regularity lemma; Stability

Indexed keywords

EID: 67349237019     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2008.12.002     Document Type: Article

References (12)

1. F. Benevides, Ramsey theory for cycles and paths, Master thesis, University of São Paulo, 2007 (in Portuguese), available from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11062007-012359/
2. Bollobás B. Modern Graph Theory (1998), Springer-Verlag, New York MR 99h:05001
3. Bondy J.A. Pancyclic graphs, I. J. Combin. Theory Ser. B 11 (1971) 80-84 MR 0285424 (44 #2642)
4. Bondy J.A., and Erdo{combining double acute accent}s P. Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14 (1973) 46-54 MR 0317991 (47 #6540)
5. Erdo{combining double acute accent}s P., Hajnal A., Sós V.T., and Szemerédi E. More results on Ramsey-Turán type problems. Combinatorica 3 1 (1983) 69-81 MR 716422 (85b:05129)
6. Figaj A., and Łuczak T. The Ramsey number for a triple of long even cycles. J. Combin. Theory Ser. B 97 4 (2007) 584-596 MR 2325798 (2008c:05119)
7. Gyárfás A., Ruszinkó M., Sárközy G.N., and Szemerédi E. Three-color Ramsey numbers for paths. Combinatorica 27 1 (2007) 35-69 MR 2310787 (2008b:05110)
8. Gyárfás A., Ruszinkó M., Sárközy G.N., and Szemerédi E. Corrigendum to: "Three-color Ramsey numbers for paths". Combinatorica 28 4 (2008) 499-502
9. Y. Kohayakawa, M. Simonovits, J. Skokan, The 3-colored Ramsey number of odd cycles, 2008, submitted for publication
10. Komlós J., and Simonovits M. Szemerédi's regularity lemma and its applications in graph theory. Combinatorics, Paul Erdo{combining double acute accent}s is Eighty, vol. 2. Keszthely, 1993. Bolyai Soc. Math. Stud. vol. 2 (1996), János Bolyai Math. Soc., Budapest 295-352 MR 1395865 (97d:05172)
11. n) ≤ (4 + o (1)) n. J. Combin. Theory Ser. B 75 2 (1999) 174-187 MR 1676887 (2000b:05096)
12. Szemerédi E. Regular partitions of graphs. Problèmes combinatoires et théorie des graphes. Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976. Colloq. Internat. CNRS vol. 260 (1978), CNRS, Paris 399-401 MR 540024 (81i:05095)