Arras, Patrick Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles. (English) Zbl 1514.05126 Electron. J. Comb. 30, No. 2, Research Paper P2.18, 31 p. (2023). MSC: 05C70 05C15 05C38 05D10 PDFBibTeX XMLCite \textit{P. Arras}, Electron. J. Comb. 30, No. 2, Research Paper P2.18, 31 p. (2023; Zbl 1514.05126) Full Text: DOI arXiv
Stein, Maya Monochromatic paths in 2-edge-coloured graphs and hypergraphs. (English) Zbl 1511.05167 Electron. J. Comb. 30, No. 1, Research Paper P1.53, 12 p. (2023). MSC: 05C55 05C38 05C35 05C65 05D10 05C70 PDFBibTeX XMLCite \textit{M. Stein}, Electron. J. Comb. 30, No. 1, Research Paper P1.53, 12 p. (2023; Zbl 1511.05167) Full Text: DOI arXiv
Lo, Allan; Pfenninger, Vincent Towards Lehel’s conjecture for 4-uniform tight cycles. (English) Zbl 1506.05154 Electron. J. Comb. 30, No. 1, Research Paper P1.13, 36 p. (2023). MSC: 05C65 05C15 05C35 05C70 PDFBibTeX XMLCite \textit{A. Lo} and \textit{V. Pfenninger}, Electron. J. Comb. 30, No. 1, Research Paper P1.13, 36 p. (2023; Zbl 1506.05154) Full Text: DOI arXiv
Pokrovskiy, Alexey Partitioning a graph into a cycle and a sparse graph. (English) Zbl 1502.05206 Discrete Math. 346, No. 1, Article ID 113161, 21 p. (2023). MSC: 05C70 05C38 05D10 05C42 PDFBibTeX XMLCite \textit{A. Pokrovskiy}, Discrete Math. 346, No. 1, Article ID 113161, 21 p. (2023; Zbl 1502.05206) Full Text: DOI arXiv
Sárközy, Gábor N. Monochromatic square-cycle and square-path partitions. (English) Zbl 1480.05059 Discrete Math. 345, No. 3, Article ID 112712, 10 p. (2022). MSC: 05C15 05C70 05C12 05C38 PDFBibTeX XMLCite \textit{G. N. Sárközy}, Discrete Math. 345, No. 3, Article ID 112712, 10 p. (2022; Zbl 1480.05059) Full Text: DOI
Lang, Richard; Lo, Allan Monochromatic cycle partitions in random graphs. (English) Zbl 1466.05183 Comb. Probab. Comput. 30, No. 1, 136-152 (2021). Reviewer: David B. Penman (Colchester) MSC: 05C70 05C80 05D10 05C38 PDFBibTeX XMLCite \textit{R. Lang} and \textit{A. Lo}, Comb. Probab. Comput. 30, No. 1, 136--152 (2021; Zbl 1466.05183) Full Text: DOI arXiv
Korándi, Dániel; Lang, Richard; Letzter, Shoham; Pokrovskiy, Alexey Minimum degree conditions for monochromatic cycle partitioning. (English) Zbl 1457.05113 J. Comb. Theory, Ser. B 146, 96-123 (2021). MSC: 05D10 05C15 05C45 PDFBibTeX XMLCite \textit{D. Korándi} et al., J. Comb. Theory, Ser. B 146, 96--123 (2021; Zbl 1457.05113) Full Text: DOI arXiv
Bustamante, Sebastián; Corsten, Jan; Frankl, Nóra; Pokrovskiy, Alexey; Skokan, Jozef Partitioning edge-colored hypergraphs into few monochromatic tight cycles. (English) Zbl 1459.05253 SIAM J. Discrete Math. 34, No. 2, 1460-1471 (2020). MSC: 05C70 05C38 05C35 05C15 05C65 PDFBibTeX XMLCite \textit{S. Bustamante} et al., SIAM J. Discrete Math. 34, No. 2, 1460--1471 (2020; Zbl 1459.05253) Full Text: DOI arXiv
Sárközy, Z. N. Monochromatic partitions in local edge colorings. (English) Zbl 1474.05280 Acta Math. Hung. 161, No. 2, 412-426 (2020). Reviewer: Ko-Wei Lih (Taipei) MSC: 05C55 05C35 05C15 PDFBibTeX XMLCite \textit{Z. N. Sárközy}, Acta Math. Hung. 161, No. 2, 412--426 (2020; Zbl 1474.05280) Full Text: DOI
Bustamante, Sebastián; Corsten, Jan; Frankl, Nóra Partitioning infinite hypergraphs into few monochromatic Berge-paths. (English) Zbl 1439.05185 Graphs Comb. 36, No. 3, 437-444 (2020). MSC: 05C70 05C65 05C38 05C63 PDFBibTeX XMLCite \textit{S. Bustamante} et al., Graphs Comb. 36, No. 3, 437--444 (2020; Zbl 1439.05185) Full Text: DOI arXiv
Simonovits, Miklós; Szemerédi, Endre Embedding graphs into larger graphs: results, methods, and problems. (English) Zbl 1443.05100 Bárány, Imre (ed.) et al., Building bridges II. Mathematics of László Lovász. Conference in celebration of László Lovász’ 70th birthday, Budapest, Hungary, July 2–6, 2018. Berlin: Springer. Bolyai Soc. Math. Stud. 28, 445-592 (2019). MSC: 05C35 05D10 05D40 05C45 05C65 05C80 05C60 PDFBibTeX XMLCite \textit{M. Simonovits} and \textit{E. Szemerédi}, Bolyai Soc. Math. Stud. 28, 445--592 (2019; Zbl 1443.05100) Full Text: DOI arXiv Backlinks: MO
Letzter, Shoham Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\). (English) Zbl 1406.05067 Electron. J. Comb. 26, No. 1, Research Paper P1.19, 67 p. (2019). MSC: 05C55 05C38 05C70 05D10 PDFBibTeX XMLCite \textit{S. Letzter}, Electron. J. Comb. 26, No. 1, Research Paper P1.19, 67 p. (2019; Zbl 1406.05067) Full Text: arXiv Link
Eugster, Marlo; Mousset, Frank Vertex covering with monochromatic pieces of few colours. (English) Zbl 1395.05091 Electron. J. Comb. 25, No. 3, Research Paper P3.33, 14 p. (2018). MSC: 05C38 05C55 PDFBibTeX XMLCite \textit{M. Eugster} and \textit{F. Mousset}, Electron. J. Comb. 25, No. 3, Research Paper P3.33, 14 p. (2018; Zbl 1395.05091) Full Text: arXiv Link
Bustamante, Sebastián; Stein, Maya Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles. (English) Zbl 1387.05191 Eur. J. Comb. 71, 213-221 (2018). MSC: 05C70 05C65 05C38 05C15 PDFBibTeX XMLCite \textit{S. Bustamante} and \textit{M. Stein}, Eur. J. Comb. 71, 213--221 (2018; Zbl 1387.05191) Full Text: DOI arXiv
Bustamante, Sebastián; Hàn, Hiệp; Stein, Maya Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. (English) Zbl 1378.05048 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 185-190 (2017). MSC: 05C15 05C65 05C38 PDFBibTeX XMLCite \textit{S. Bustamante} et al., Electron. Notes Discrete Math. 61, 185--190 (2017; Zbl 1378.05048) Full Text: DOI
Lu, Changhong; Mao, Rui; Wang, Bing; Zhang, Ping Cover \(k\)-uniform hypergraphs by monochromatic loose paths. (English) Zbl 1373.05067 Electron. J. Comb. 24, No. 4, Research Paper P23, 9 p. (2017). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{C. Lu} et al., Electron. J. Comb. 24, No. 4, Research Paper P23, 9 p. (2017; Zbl 1373.05067) Full Text: Link
Lang, Richard; Schaudt, Oliver; Stein, Maya Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles. (English) Zbl 1365.05222 SIAM J. Discrete Math. 31, No. 2, 1374-1402 (2017). MSC: 05C69 05C15 05C55 05D10 05C38 05C70 PDFBibTeX XMLCite \textit{R. Lang} et al., SIAM J. Discrete Math. 31, No. 2, 1374--1402 (2017; Zbl 1365.05222) Full Text: DOI arXiv
Bal, Deepak; DeBiasio, Louis Partitioning random graphs into monochromatic components. (English) Zbl 1355.05192 Electron. J. Comb. 24, No. 1, Research Paper P1.18, 25 p. (2017). MSC: 05C70 05C80 05C55 05D10 05C38 PDFBibTeX XMLCite \textit{D. Bal} and \textit{L. DeBiasio}, Electron. J. Comb. 24, No. 1, Research Paper P1.18, 25 p. (2017; Zbl 1355.05192) Full Text: arXiv Link
Sárközy, Gábor N. Monochromatic cycle power partitions. (English) Zbl 1351.05088 Discrete Math. 340, No. 2, 72-80 (2017). MSC: 05C15 05C70 05C38 PDFBibTeX XMLCite \textit{G. N. Sárközy}, Discrete Math. 340, No. 2, 72--80 (2017; Zbl 1351.05088) Full Text: DOI
DeBiasio, Louis; Nelsen, Luke L. Monochromatic cycle partitions of graphs with large minimum degree. (English) Zbl 1350.05135 J. Comb. Theory, Ser. B 122, 634-667 (2017). MSC: 05C70 05C38 05C07 05C35 05D10 PDFBibTeX XMLCite \textit{L. DeBiasio} and \textit{L. L. Nelsen}, J. Comb. Theory, Ser. B 122, 634--667 (2017; Zbl 1350.05135) Full Text: DOI arXiv
Lang, Richard; Stein, Maya Local colourings and monochromatic partitions in complete bipartite graphs. (English) Zbl 1348.05077 Eur. J. Comb. 60, 42-54 (2017). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{R. Lang} and \textit{M. Stein}, Eur. J. Comb. 60, 42--54 (2017; Zbl 1348.05077) Full Text: DOI
Gyárfás, András Vertex covers by monochromatic pieces – a survey of results and problems. (English) Zbl 1334.05085 Discrete Math. 339, No. 7, 1970-1977 (2016). MSC: 05C55 PDFBibTeX XMLCite \textit{A. Gyárfás}, Discrete Math. 339, No. 7, 1970--1977 (2016; Zbl 1334.05085) Full Text: DOI arXiv
Barát, János; Sárközy, Gábor N. Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles. (English) Zbl 1333.05235 J. Graph Theory 81, No. 4, 317-328 (2016). MSC: 05C70 05C15 05C38 PDFBibTeX XMLCite \textit{J. Barát} and \textit{G. N. Sárközy}, J. Graph Theory 81, No. 4, 317--328 (2016; Zbl 1333.05235) Full Text: DOI Link
Conlon, David; Stein, Maya Monochromatic cycle partitions in local edge colorings. (English) Zbl 1330.05125 J. Graph Theory 81, No. 2, 134-145 (2016). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{D. Conlon} and \textit{M. Stein}, J. Graph Theory 81, No. 2, 134--145 (2016; Zbl 1330.05125) Full Text: DOI arXiv Link
Grinshpun, Andrey; Sárközy, Gábor N. Monochromatic bounded degree subgraph partitions. (English) Zbl 1322.05113 Discrete Math. 339, No. 1, 46-53 (2016). MSC: 05C70 05C55 05C15 PDFBibTeX XMLCite \textit{A. Grinshpun} and \textit{G. N. Sárközy}, Discrete Math. 339, No. 1, 46--53 (2016; Zbl 1322.05113) Full Text: DOI arXiv
Schaudt, Oliver; Stein, Maya Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. (English) Zbl 1347.05160 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 313-318, electronic only (2015). MSC: 05C70 05C38 05C15 PDFBibTeX XMLCite \textit{O. Schaudt} and \textit{M. Stein}, Electron. Notes Discrete Math. 50, 313--318 (2015; Zbl 1347.05160) Full Text: DOI arXiv
Lang, Richard; Schaudt, Oliver; Stein, Maya Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. (English) Zbl 1346.05235 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 787-794, electronic only (2015). MSC: 05C70 05C15 05C38 PDFBibTeX XMLCite \textit{R. Lang} et al., Electron. Notes Discrete Math. 49, 787--794 (2015; Zbl 1346.05235) Full Text: DOI
Gyárfás, András; Sárközy, Gábor N.; Selkow, Stanley Coverings by few monochromatic pieces: a transition between two Ramsey problems. (English) Zbl 1306.05149 Graphs Comb. 31, No. 1, 131-140 (2015). MSC: 05C55 05C70 05D10 PDFBibTeX XMLCite \textit{A. Gyárfás} et al., Graphs Comb. 31, No. 1, 131--140 (2015; Zbl 1306.05149) Full Text: DOI arXiv Link
Balogh, József; Barát, János; Gerbner, Dániel; Gyárfás, András; Sárközy, Gábor N. Partitioning 2-edge-colored graphs by monochromatic paths and cycles. (English) Zbl 1340.05069 Combinatorica 34, No. 5, 507-526 (2014). Reviewer: Peter Horak (Tacoma) MSC: 05C15 05D10 05B07 05E99 PDFBibTeX XMLCite \textit{J. Balogh} et al., Combinatorica 34, No. 5, 507--526 (2014; Zbl 1340.05069) Full Text: DOI arXiv Link
Gyárfás, András; Sárközy, Gábor Monochromatic loose-cycle partitions in hypergraphs. (English) Zbl 1300.05199 Electron. J. Comb. 21, No. 2, Research Paper P2.36, 10 p. (2014). MSC: 05C65 05C38 05C70 PDFBibTeX XMLCite \textit{A. Gyárfás} and \textit{G. Sárközy}, Electron. J. Comb. 21, No. 2, Research Paper P2.36, 10 p. (2014; Zbl 1300.05199) Full Text: Link
Pokrovskiy, Alexey Partitioning edge-coloured complete graphs into monochromatic cycles and paths. (English) Zbl 1300.05260 J. Comb. Theory, Ser. B 106, 70-97 (2014). MSC: 05C70 05C38 05C55 05C15 PDFBibTeX XMLCite \textit{A. Pokrovskiy}, J. Comb. Theory, Ser. B 106, 70--97 (2014; Zbl 1300.05260) Full Text: DOI arXiv
Sárközy, Gábor N. Improved monochromatic loose cycle partitions in hypergraphs. (English) Zbl 1298.05239 Discrete Math. 334, 52-62 (2014). MSC: 05C65 05C70 05C38 05C35 PDFBibTeX XMLCite \textit{G. N. Sárközy}, Discrete Math. 334, 52--62 (2014; Zbl 1298.05239) Full Text: DOI
Jin, Zemin; Zhu, Peipei Heterochromatic tree partition number in complete multipartite graphs. (English) Zbl 1302.05140 J. Comb. Optim. 28, No. 2, 321-340 (2014). MSC: 05C70 05C15 05C05 PDFBibTeX XMLCite \textit{Z. Jin} and \textit{P. Zhu}, J. Comb. Optim. 28, No. 2, 321--340 (2014; Zbl 1302.05140) Full Text: DOI
Sárközy, Gábor N.; Selkow, Stanley M.; Song, Fei An improved bound for vertex partitions by connected monochromatic \(K\)-regular graphs. (English) Zbl 1264.05108 J. Graph Theory 73, No. 1-2, 127-145 (2013). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{G. N. Sárközy} et al., J. Graph Theory 73, No. 1--2, 127--145 (2013; Zbl 1264.05108) Full Text: DOI
Jin, Ze-min; Li, Xue-liang Partitioning complete graphs by heterochromatic trees. (English) Zbl 1254.05157 Acta Math. Appl. Sin., Engl. Ser. 28, No. 4, 625-630 (2012). MSC: 05C70 05C05 05C15 05C75 PDFBibTeX XMLCite \textit{Z.-m. Jin} and \textit{X.-l. Li}, Acta Math. Appl. Sin., Engl. Ser. 28, No. 4, 625--630 (2012; Zbl 1254.05157) Full Text: DOI arXiv
Jin, Zemin; Wen, Shili; Zhou, Shujun Heterochromatic tree partition problem in complete tripartite graphs. (English) Zbl 1238.05212 Discrete Math. 312, No. 4, 789-802 (2012). MSC: 05C70 05C15 05C05 PDFBibTeX XMLCite \textit{Z. Jin} et al., Discrete Math. 312, No. 4, 789--802 (2012; Zbl 1238.05212) Full Text: DOI
Pokrovskiy, Alexey Partitioning 3-coloured complete graphs into three monochromatic paths. (English) Zbl 1274.05173 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 717-722 (2011). MSC: 05C15 05C38 05C70 PDFBibTeX XMLCite \textit{A. Pokrovskiy}, Electron. Notes Discrete Math. 38, 717--722 (2011; Zbl 1274.05173) Full Text: Link
Sárközy, Gábor N.; Selkow, Stanley M.; Song, Fei Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs. (English) Zbl 1228.05239 Discrete Math. 311, No. 18-19, 2079-2084 (2011). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{G. N. Sárközy} et al., Discrete Math. 311, No. 18--19, 2079--2084 (2011; Zbl 1228.05239) Full Text: DOI
Sárközy, Gábor N. Monochromatic cycle partitions of edge-colored graphs. (English) Zbl 1222.05075 J. Graph Theory 66, No. 1, 57-64 (2011). MSC: 05C15 05C38 05C70 PDFBibTeX XMLCite \textit{G. N. Sárközy}, J. Graph Theory 66, No. 1, 57--64 (2011; Zbl 1222.05075) Full Text: DOI
Bessy, Stéphane; Thomassé, Stéphan Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture. (English) Zbl 1216.05110 J. Comb. Theory, Ser. B 100, No. 2, 176-180 (2010). MSC: 05C70 05C38 05C15 PDFBibTeX XMLCite \textit{S. Bessy} and \textit{S. Thomassé}, J. Comb. Theory, Ser. B 100, No. 2, 176--180 (2010; Zbl 1216.05110) Full Text: DOI Link
Kano, Mikio; Li, Xueliang Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey. (English) Zbl 1190.05045 Graphs Comb. 24, No. 4, 237-263 (2008). MSC: 05C05 05-02 PDFBibTeX XMLCite \textit{M. Kano} and \textit{X. Li}, Graphs Comb. 24, No. 4, 237--263 (2008; Zbl 1190.05045) Full Text: DOI
Allen, Peter Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles. (English) Zbl 1169.05370 Comb. Probab. Comput. 17, No. 4, 471-486 (2008). MSC: 05C70 05C15 05C38 PDFBibTeX XMLCite \textit{P. Allen}, Comb. Probab. Comput. 17, No. 4, 471--486 (2008; Zbl 1169.05370) Full Text: DOI
Chen, He; Jin, Zemin; Li, Xueliang; Tu, Jianhua Heterochromatic tree partition numbers for complete bipartite graphs. (English) Zbl 1160.05014 Discrete Math. 308, No. 17, 3871-3878 (2008). MSC: 05C05 05C15 05C70 05C75 PDFBibTeX XMLCite \textit{H. Chen} et al., Discrete Math. 308, No. 17, 3871--3878 (2008; Zbl 1160.05014) Full Text: DOI
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre An improved bound for the monochromatic cycle partition number. (English) Zbl 1115.05031 J. Comb. Theory, Ser. B 96, No. 6, 855-873 (2006). Reviewer: Mark E. Watkins (Syracuse) MSC: 05C15 05C35 05C70 PDFBibTeX XMLCite \textit{A. Gyárfás} et al., J. Comb. Theory, Ser. B 96, No. 6, 855--873 (2006; Zbl 1115.05031) Full Text: DOI
Sárközy, Gábor N.; Selkow, Stanley M. Vertex partitions by connected monochromatic \(k\)-regular graphs. (English) Zbl 1028.05093 J. Comb. Theory, Ser. B 78, No. 1, 115-122 (2000). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{G. N. Sárközy} and \textit{S. M. Selkow}, J. Comb. Theory, Ser. B 78, No. 1, 115--122 (2000; Zbl 1028.05093) Full Text: DOI