Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles

DOI10.1016/j.ejc.2023.103838zbMath1548.05263MaRDI QIDQ6612514

Richard Lang, Peter M. Allen, Jozef Skokan, Julia Böttcher, Maya Jakobine Stein

Publication date: 30 September 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

cycle decompositiongraph partitiontwo-colored complete graph

Mathematics Subject Classification ID

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

This page was built for publication: Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles