Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Tomasz Łuczak, Vojtěch Rödl, Endre Szemerédi

Type: Article

Publication Date: 1998-12-01

Citations: 59

DOI: https://doi.org/10.1017/s0963548398003599

View Publication

Locations

Combinatorics Probability Computing - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles	2024	Fabrício Benevides Arthur Lima Quintino Alexandre Talon
+	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles	2014	Oliver Schaudt Maya Stein
+ PDF Chat	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles	2015	Oliver Schaudt Maya Stein
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2012	Alexey Pokrovskiy
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2012	Alexey Pokrovskiy
+	Almost partitioning a 3-edge-coloured $K_{n,n}$ into 5 monochromatic cycles	2015	Richard Lang Oliver Schaudt Maya Stein
+	Partitioning two-coloured complete multipartite graphs into monochromatic paths.	2014	Oliver Schaudt Maya Stein
+	Partitioning edge-coloured complete graphs into monochromatic cycles	2013	Alexey Pokrovskiy
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy
+ PDF Chat	Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles	2011	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles	2022	Peter J. Allen Julia Böttcher Richard Lang Jozef Skokan Maya Stein
+ PDF Chat	Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles	2018	Oliver Schaudt Maya Stein
+	Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles	2015	Richard Lang Oliver Schaudt Maya Stein
+	Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles	2017	Richard Lang Oliver Schaudt Maya Stein
+	Partitioning 3-coloured complete graphs into three monochromatic paths	2011	Alexey Pokrovskiy
+	Partitioning a graph into monochromatic connected subgraphs	2017	António Girão Shoham Letzter Julian Sahasrabudhe
+	Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles	2008	Peter Allen
+	Partitioning 2-coloured complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml7" display="inline" overflow="scroll" altimg="si7.gif"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs into monochromatic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml8" display="inline" overflow="scroll" altimg="si8.gif"><mml:mi>ℓ</mml:mi></mml:math>-cycles	2018	Sebastián Bustamante Maya Stein
+ PDF Chat	Partitioning 2-edge-colored graphs by monochromatic paths and cycles	2014	József Balogh János Barát Dániel Gerbner András Gyárfás Gábor N. Sárközy
+	Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles	2023	Allan Lo Vincent Pfenninger

Works That Cite This (58)

Action	Title	Year	Authors
+	Partitioning edge-coloured complete graphs into monochromatic cycles	2013	Alexey Pokrovskiy
+ PDF Chat	Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+	Monochromatic Structures in Edge-coloured Graphs and Hypergraphs - A survey	2015	Shinya Fujita Henry Liu Colton Magnant
+	Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles	2015	Richard Lang Oliver Schaudt Maya Stein
+	Monochromatic cycle partitions of graphs with large minimum degree	2016	Louis DeBiasio Luke L. Nelsen
+	An improved bound for the monochromatic cycle partition number	2006	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé
+	Vertex Partitions by Connected Monochromatic k-Regular Graphs	2000	Gábor N. Sárközy Stanley M. Selkow
+	Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles	2008	Peter Allen
+	Monochromatic bounded degree subgraph partitions	2015	Andrey Grinshpun Gábor N. Sárközy

Works Cited by This (5)

Action	Title	Year	Authors
+	Vertex coverings by monochromatic paths and cycles	1983	András Gyárfás
+	Partitioning Complete Bipartite Graphs by Monochromatic Cycles	1997	Penny Haxell
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Vertex coverings by monochromatic cycles and trees	1991	Péter L. Erdős András Gyárfás L. Pyber
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi