Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
<|reference_start|>Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles: Given an $r$-colouring of the edges of a graph $G$, we say that it can be partitioned into $p$ monochromatic cycles when there exists a set of $p$ vertex-disjoint monochromatic cycles covering all the vertices of $G$. In the literature of this problem, an edge and a single vertex both count as a cycle.   We show that for every $2$-colouring of the edges of a complete balanced bipartite graph, $K_{n,n}$, it can be partitioned into at most 4 monochromatic cycles. This type of question was first studied in 1970 for complete graphs and in 1983, by Gy\'arf\'as and Lehel, for $K_{n,n}$. In 2014, Pokrovskiy, has showed that any $2$-colouring of the edges of $K_{n,n}$ can be partitioned into at most $3$ paths. It turns out that finding monochromatic cycles instead of paths is a natural question that has also being asked for other graphs. In 2015, Schaudt and Stein have showed that at most 14 cycles are necessary.<|reference_end|>
@article{benevides2024partitioning,
    title={Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles},
    author={Fabr'icio Siqueira Benevides, Arthur Lima Quintino and Alexandre
  Talon},
    journal={arXiv preprint arXiv:2409.03394},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.03394},
    primaryClass={math.CO cs.DM}
}