Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Combinatorics Probability and Computing

Volumn 7, Issue 4, 1998, Pages 423-436

  Łuczak, Tomasz ^a,b   Rödl, Vojtěch ^b   Szemerédi, Endre ^c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b EMORY UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0542423546     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548398003599     Document Type: Article

References (8)

1. Ayel, J. (1979) Sur l'existence de deux cycles supplémentaires unicolorés disjoints et de couleurs différentes dans un graphe complet bicolore. Thesis, University of Grenoble.
2. Erdos, P., Gyárfás, A. and Pyber, L. (1991) Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51 90-95.
3. Gyárfás, A. (1983) Vertex coverings by monochromatic paths and cycles. J. Graph Theory 7 131-135.
4. Gyárfás, A. (1989) Covering complete graphs by monochromatic paths and cycles. In Irregularities of Partitions, Vol. 8 of Algorithms and Combinatorics, Springer, pp. 81-91.
5. Haxell, P. E. (1997) Partitioning complete bipartite graphs by monochromatic cycles. J. Combin. Theory Ser. B 69 210-218.
6. Komlós, J., Sárközy G. N. and Szemerédi, E. (1997) Blow-up Lemma. Combinatorica 17 109-124.
7. Komlós, J. and Simonovits, M. (1996) Szemerédi's Regularity Lemma and its applications in graph theory. In Combinatorics: Paul Erdos is Eighty, Vol. 2 (D. Miklós, V. T. Sós and T. Szonyi, eds), Bolyai Society Mathematical Studies, Keszthely, Hungary, pp. 295-352.
8. Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes Combinatoires et Théorie des Graphes, Proc. Colloque Inter. CNRS (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas and D. Sotteau, eds), CNRS, Paris, pp. 399-401.