2000 character limit reached
Almost partitioning a 3-edge-coloured $K_{n,n}$ into 5 monochromatic cycles
Published 30 Sep 2015 in math.CO | (1510.00060v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.