Abstract

We show that any colouring with three colours of the edges of the complete bipartite graph Kn,n contains 18 vertex-disjoint monochromatic cycles which together cover all vertices. The minimum number of cycles needed for such a covering is five, and we show that this lower bound is asymptotically true. This extends known results for complete graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call