Three-color ramsey numbers for paths

Combinatorica

Volumn 27, Issue 1, 2007, Pages 35-69

  Gyárfás, András ^a   Ruszinkó, Miklós ^a   Sárközy, Gábor N ^a,b   Szemerédi, Endre ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b Worcester Polytechnic Institute   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

05C38; 05C55

Indexed keywords

EID: 33847380533     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-0043-4     Document Type: Article

References (21)

1. B. ANDRÁSFAI: Remarks on a paper of Gerencsér and Gyárfás, Annales Univ. Sci. Bud. de Rol. Eötvös, Sect. Math. XIII. (1970), 103-107.
2. C. BERGE: Graphs and Hypergraphs, North-Holland, 1973.
3. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, London, 1978.
4. E. J. COCKAYNE and P. J. LORIMER: The Ramsey number for stripes, J. Austral. Math. Soc. Ser. A 19 (1975), 252-256.
5. A. FIGAJ and T. ŁUCZAK: The Ramsey number for a triple of long even cycles, to appear in Journal of Combinatorial Theory, Ser. B.
6. R. J. FAUDREE and R. H. SCHELP: Path Ramsey numbers in multicolorings, Journal of Combinatorial Theory, Ser. B 19 (1975), 150-160.
7. Z. FÜREDI and A. GYÁRFÁS: Covering t-element sets by partitions, Europ. J. of Combinatorics 12 (1991), 483-489.
8. L. GERENCSÉR and A. GYÁRFÁS: On Ramsey-type problems, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 10 (1967), 167-170.
9. R. L. GRAHAM, B. L. ROTHSCHILD and J. H. SPENCER: Ramsey Theory, John Wiley & Sons, 1990.
10. A. GYÁRFÁS, M. RUSZINKÓ, G. N. SÁRKÖZY and E. SZEMERÉDI: Three-color Ramsey number for paths, unpublished manuscript.
11. Y. KOHAYAKAWA, M. SIMONOVITS and J. SKOKAN: The 3-colored Ramsey number of odd cycles, personal communication.
12. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: Proof of a packing conjecture of Bollobás, Combinatorics, Probability and Computing 4 (1995), 241-255.
13. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: Blow-up Lemma, Combinatorica 17 (1997), 109-123.
14. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: An algorithmic version of the Blow-up Lemma, Random Structures and Algorithms 12 (1998), 297-312.
15. J. KOMLÓS and M. SIMONOVITS: Szemerédi'fs Regularity Lemma and its applications in graph theory, in Combinatorics, Paul Erdos is Eighty (D. Miklós, V. T. Sós and T. Szonyi, Eds.), Bolyai Society Math. Studies, Vol. 2, pp. 295-352, Budapest, 1996.
16. L. LOVÁSZ and M. D. PLUMMER: Matching Theory, Joint edition of North-Holland and Akadémiai Kiadó, 1986.
17. n) ≤ (4+o(1))n; Journal of Combinatorial Theory, Ser. B 75 (1999), 174-187.
18. L. PÓSA: A theorem concerning Hamilton lines, Publ. Math. Inst. Hung. Acad. Sci. 7 (1962), 225-226.
19. S. P. RADZISZOWSKI: Small Ramsey numbers, Electronic Journal of Combinatorics (2002), DS1.
20. F. P. RAMSEY: On a problem of formal logic, Proc. London Math. Soc., 2nd Ser. 30 (1930), 264-286.
21. E. SZEMERÉDI: Regular partitions of graphs, Colloques Internationaux C.N.R.S., No 260 - Problèmes Combinatoires et Théorie des Graphes, Orsay (1976), 399-401.