Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Richard Lang, Oliver Schaudt, Maya Stein

Type: Article

Publication Date: 2015-11-01

Citations: 6

DOI: https://doi.org/10.1016/j.endm.2015.06.106

View Publication

Locations

Electronic Notes in Discrete Mathematics - View

Similar Works

Action	Title	Year	Authors
+	Partitioning edge-coloured complete graphs into monochromatic cycles	2013	Alexey Pokrovskiy
+	Partitioning 3-coloured complete graphs into three monochromatic paths	2011	Alexey Pokrovskiy
+ PDF Chat	Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths	2020	Carl Bürger Max Pitz
+ 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 two-coloured complete multipartite graphs into monochromatic paths.	2014	Oliver Schaudt Maya Stein
+	Large monochromatic components in 3-colored non-complete graphs	2020	Zahra Rahimi
+	Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree	2024	Yiran Zhang Yuejian Peng
+	Partitioning a 2-edge-coloured graph of minimum degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e314" altimg="si8.svg"><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>/</mml:mo><mml:mn>3</mml:mn><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>o</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math> into three monochromatic cycles	2024	Peter Allen Julia Böttcher Richard Lang Jozef Skokan Maya Stein
+	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
+	Monochromatic paths in $2$-edge coloured graphs and hypergraphs	2022	Maya Stein
+	Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs	2023	Maya Stein
+ PDF Chat	Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles	2018	Oliver Schaudt Maya Stein
+	Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles	1998	Tomasz Łuczak Vojtěch Rödl Endre Szemerédi
+	Path and cycle decompositions of complete equipartite graphs: Four parts	2008	Elizabeth J. Billington Nicholas J. Cavenagh Benjamin R. Smith
+	Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles	2017	Sebastián Bustamante Hiệp Hàn Maya Stein
+	Decomposing complete tripartite graphs into cycles of lengths 3 and 4	1999	Elizabeth J. Billington
+	Decomposing complete tripartite graphs into cycles of lengths 3 and 4	1999	E Billington
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy

Works That Cite This (5)

Action	Title	Year	Authors
+	Local colourings and monochromatic partitions in complete bipartite graphs	2016	Richard Lang Maya Stein
+ PDF Chat	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles	2015	Oliver Schaudt Maya Stein
+	Local colourings and monochromatic partitions in complete bipartite graphs	2015	Richard Lang Maya Stein
+	Partitioning two-coloured complete multipartite graphs into monochromatic paths.	2014	Oliver Schaudt Maya Stein
+	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles	2014	Oliver Schaudt Maya Stein

Works Cited by This (20)

Action	Title	Year	Authors
+ PDF Chat	Holes in Graphs	2001	Yuejian Peng Vojtěch Rödl Andrzej Ruciński
+	Local colourings and monochromatic partitions in complete bipartite graphs	2015	Richard Lang Maya Stein
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé
+	Partitioning Complete Bipartite Graphs by Monochromatic Cycles	1997	Penny Haxell
+	Partitioning 3-coloured complete graphs into three monochromatic paths	2011	Alexey Pokrovskiy
+ PDF Chat	Three-color Ramsey numbers for paths	2008	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+ 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
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy
+	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