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

DOI10.1016/J.ENDM.2015.06.106MaRDI QIDQ324372zbMATH OpenOpenAlexFDO

Authors Richard Lang, Oliver Schaudt, Maya Stein

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.106

zbMATH Keywords

complete bipartite graphcomplete graphedge-coloured graphmonochromatic cycle partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning complete bipartite graphs by monochromatic cycles

Cites work

• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• An improved bound for the monochromatic cycle partition number
• Blow-up lemma
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Holes in graphs
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• Local colourings and monochromatic partitions in complete bipartite graphs
• One-sided coverings of colored complete bipartite graphs
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning complete bipartite graphs by monochromatic cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Three-color Ramsey numbers for paths
• Vertex coverings by monochromatic cycles and trees

Cited in

(13)

• Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
• Partitioning complete bipartite graphs by monochromatic cycles
• Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
• Disjoint properly colored cycles in edge-colored complete bipartite graphs
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
• Partitioning 3-coloured complete graphs into three monochromatic paths
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Triangulations of the sphere, bitrades and abelian groups
• Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Local colourings and monochromatic partitions in complete bipartite graphs
• Local colourings and monochromatic partitions in complete bipartite graphs
• Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles

This page was built for publication: Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324372)