Almost partitioning a 3-edge-coloured K_n,n into 5 monochromatic cycles

2015/09/30 by Lang, Richard, Schaudt, Oliver, Stein, Maya · 1 citation
#05C38 #05C69 #05C75 #Combinatorics (math.CO) #F.2.2 #FOS: Mathematics

paper · doi:10.48550/arxiv.1510.00060

Abstract

We show that for any colouring of the edges of the complete bipartite graph K_n,n with 3 colours there are 5 disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 disjoint monochromatic cycles together cover all vertices.

Cited by

• Monochromatic cycle partitions in 3-mean edge-colourings

Related

• Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
• Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
• Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles