Ore- and Pósa-Type Conditions for Partitioning 2-Edge-Coloured Graphs into Monochromatic Cycles
Ore- and Pósa-Type Conditions for Partitioning 2-Edge-Coloured Graphs into Monochromatic Cycles
In 2019, Letzter confirmed a conjecture of Balogh, Bar\'at, Gerbner, Gy\'arf\'as and S\'ark\"ozy, proving that every large $2$-edge-coloured graph $G$ on $n$ vertices with minimum degree at least $3n/4$ can be partitioned into two monochromatic cycles of different colours. Here, we propose a weaker condition on the degree sequence of …