An improved bound for the monochromatic cycle partition number

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 6, 2006, Pages 855-873

  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

Edge colorings; Monochromatic partitions; Regularity Lemma

Indexed keywords

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

References (17)

1. Alon N., and Spencer J.H. The Probabilistic Method (1991), John Wiley and Sons
2. Bollobás B. Extremal Graph Theory (1978), Academic Press, London
3. Diestel R. Graph Theory (1997), Springer-Verlag, New York
4. Erdo{combining double acute accent}s P., and Gallai T. On maximal paths and circuits of graphs. Acta Math. Sci. Hungar. 10 (1959) 337-356
5. Erdo{combining double acute accent}s P., Gyárfás A., and Pyber L. Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51 (1991) 90-95
6. Gyárfás A. Covering complete graphs by monochromatic paths. Irregularities of Partitions. Algorithms Combin. vol. 8 (1989), Springer-Verlag 89-91
7. A. Gyárfás, M. Ruszinkó, G.N. Sárközy, E. Szemerédi, Three-color Ramsey number for paths, Combinatorica, in press
8. Haxell P. Partitioning complete bipartite graphs by monochromatic cycles. J. Combin. Theory Ser. B 69 (1997) 210-218
9. Komlós J., Sárközy G.N., and Szemerédi E. Blow-up Lemma. Combinatorica 17 (1997) 109-123
10. Komlós J., Sárközy G.N., and Szemerédi E. An algorithmic version of the Blow-up Lemma. Random Structures Algorithms 12 (1998) 297-312
11. Komlós J., and Simonovits M. Szemerédi's Regularity Lemma and its applications in graph theory. In: Miklós D., Sós V.T., and Szo{combining double acute accent}nyi T. (Eds). Combinatorics, Paul Erdo{combining double acute accent}s is Eighty. Bolyai Soc. Math. Stud. vol. 2 (1996), Budapest 295-352
12. n) ≤ (4 + o (1)) n. J. Combin. Theory Ser. B 75 (1999) 174-187
13. Łuczak T., Rödl V., and Szemerédi E. Partitioning two-colored complete graphs into two monochromatic cycles. Probab. Combin. Comput. 7 (1998) 423-436
14. Mader W. Existenz n-fach zusammenhängen der Teilgraphen in Graphen genügend großer Kantendichte. Abh. Math. Sem. Univ. Hamburg 37 (1972) 86-97
15. R. Martin, E. Szemerédi, Quadripartite version of the Hajnal-Szemerédi Theorem, Discrete Math. (special edition in honor of Miklós Simonovits), in press
16. Sárközy G.N., and Selkow S. Vertex partitions by connected monochromatic k-regular graphs. J. Combin. Theory Ser. B 78 (2000) 115-122
17. o 260 - Problèmes Combinatoires et Théorie des Graphes, Orsay, 1976, pp. 399-401