Abstract
We present results on partitioning the vertices of 2-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárközy: the vertex set of every 2-edge-colored graph can be partitioned into at most 2α(G) monochromatic cycles, where α(G) denotes the independence number of G. Another direction, emerged recently from a conjecture of Schelp, is to consider colorings of graphs with given minimum degree. We prove that apart from o(|V (G)|) vertices, the vertex set of any 2-edge-colored graph G with minimum degree at least \(\tfrac{{(1 + \varepsilon )3|V(G)|}} {4}\)can be covered by the vertices of two vertex disjoint monochromatic cycles of distinct colors. Finally, under the assumption that \(\bar G\) does not contain a fixed bipartite graph H, we show that in every 2-edge-coloring of G, |V (G)| − c(H) vertices can be covered by two vertex disjoint paths of different colors, where c(H) is a constant depending only on H. In particular, we prove that c(C 4)=1, which is best possible.
Similar content being viewed by others
References
P. Allen: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles, Combinatorics, Probability and Computing 17 (2008), 471–486.
J. Ayel: Sur l’existence de deux cycles supplementaires unicolorés, disjoints et de couleurs differentes dans un graphe complet bicolore, Thesis, University of Grenoble, (1979).
F. S. Benevides, T. Luczak, A. Scott, J. Skokan, M. White: Monochromatic cycles and the monochromatic circumference in 2-coloured graphs, Combin. Probab. Comput. 21 (2012), 57–87.
S. Bessy, S. Thomassé: Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture, Journal of Combinatorial Theory, Series B 100 (2010), 176–180.
P. Erdős, T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–356.
P. Erdős, A. Gyárfás, L. Pyber: Vertex coverings by monochromatic cycles and trees, Journal of Combinatorial Theory, Series B 51 (1991), 90–95.
R. J. Faudree, S. L. Lawrence, T. D. Parsons, R. H. Schelp: Path-Cycle Ramsey numbers, Discrete Mathematics 10 (1974), 269–277.
A. Gyárfás: Vertex coverings by monochromatic paths and cycles, Journal of Graph Theory 7 (1983), 131–135.
A. Gyárfás, M. Ruszinkó, G. Sárközy, E. Szemerédi: An improved bound for the monochromatic cycle partition number, Journal of Combinatorial Theory, Series B 96 (2006), 855–873.
A. Gyárfás, G. Simonyi, Á. Tóth: Gallai colorings and domination in multipartite digraphs, J. Graph Theory 71 (2012), 278–292.
A. Gyárfás: Partition coverings and blocking sets in hypergraphs (in Hungarian), Communications of the Computer and Automation Institute of the Hungarian Academy of Sciences 71 (1977) 62.
A. Gyárfás, J. Lehel, G. N. Sárközy, R. H. Schelp: Monochromatic Hamiltonian Berge cycles in colored complete hypergraphs, Journal of Combinatorial Theory, Ser. B 98 (2008), 342–358.
A. Gyárfás, M. Ruszinkó, G. N. Sárközy, E. Szemerédi: Tripartite Ramsey numbers for paths, Journal of Graph Theory 55 (2007), 164–170.
A. Gyárfás, M. Ruszinkó, G. Sárközy, E. Szemerédi: Three-color Ramsey numbers for paths, Combinatorica 27 (2007), 35–69.
A. Gyárfás, M. Ruszinkó, G. Sárközy, E. Szemerédi: Partitioning 3-colored complete graphs into three monochromatic cycles, Electronic Journal of Combinatorics 18 (2011), Nr. 53.
A. Gyárfás, G. N. Sárközy: Gallai colorings of non-complete graphs, Discrete Mathematics 310 (2010), 977–980.
A. Gyárfás, G. N. Sárközy: Star versus two stripes Ramsey numbers and a conjecture of Schelp, Combin. Probab. Comput. 21 (2012), 179–186.
J. Komlós and M. Simonovits: Szemerédi’s Regularity Lemma and its applications in Graph Theory, in: Combinatorics, Paul Erdős is Eighty (D. Miklós, V.T. Sós and T. Szőnyi, Eds.), 295–352, Bolyai Society Mathematical Studies, Vol. 2, Budapest, 1996.
T. Kővári, V. T. Sós, P. Turán: On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954) 50–57.
L. Lovász: Combinatorial problems and exercises, 2nd Edition, American Mathematical Society, Providence, Rhode Island, 2007.
T. Łuczak: R(C n;C n;C n) ≤ (4+o(1))n, Journal of Combinatorial Theory, Ser. B 75 (1999), 174–187.
T. Łuczak, V. Rödl, E. Szemerédi: Partitioning two-colored complete graphs into two monochromatic cycles, Probability, Combinatorics and Computing 7 (1998), 423–436.
L. Pósa: On the circuits of finite graphs, MTA Mat. Kut. Int. Közl. 8 (1963), 355–361.
A. Pokrovskiy: Partitioning 3-coloured complete graphs into three monochromatic paths, Electronic Notes in Discrete Mathematics 38 (2011) 717–722.
A. Pokrovskiy: Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Journal of Combinatorial Theory B 106 (2014), 70–97.
G. N. Sárközy: On 2-factors with k components, Discrete Mathematics 308 (2008), 1962–1972.
G. N. Sárközy: Monochromatic cycle partitions of edge-colored graphs, Journal of graph theory 66 (2011), 57–64.
R. H. Schelp: Some Ramsey-Turán type problems and related questions, Discrete Mathematics 312 (2012), 2158–2161.
E. Szemerédi: Regular partitions of graphs, Colloques Internationaux C.N.R.S. N° 260 — Problèmes Combinatoires et Théorie des Graphes, Orsay (1976), 399–401.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by NSF CAREER Grant DMS-0745185, UIUC Campus Research Board Grant 11067, and OTKA Grant K 76099.
Research is supported by OTKA Grants PD 75837 and K 76099, and the János Bolyai Research Scholarship of the Hungarian Academy of Sciences. Present address: School of Mathematical Sciences, Monash University, 3800 Victoria.
Research supported by Hungarian Science Foundation Grant OTKA NN 102029, under the EuroGIGA programs ComPoSe and GraDR.
Research supported in part by OTKA Grant K104373.
Research supported in part by NSF Grant DMS-0968699 and by OTKA Grant K104373.
Part of the research reported in this paper was done at the 3rd Emléktábla Workshop (2011) in Balatonalmádi, Hungary.
Rights and permissions
About this article
Cite this article
Balogh, J., Barát, J., Gerbner, D. et al. Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Combinatorica 34, 507–526 (2014). https://doi.org/10.1007/s00493-014-2935-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-014-2935-4