Almost partitioning a 3-edge-coloured $K_{n,n}$ into 5 monochromatic cycles
Combinatorics
2016-11-18 v3
Abstract
We show that for any colouring of the edges of the complete bipartite graph with 3 colours there are 5 disjoint monochromatic cycles which together cover all but of the vertices. In the same situation, 18 disjoint monochromatic cycles together cover all vertices.
Keywords
Cite
@article{arxiv.1510.00060,
title = {Almost partitioning a 3-edge-coloured $K_{n,n}$ into 5 monochromatic cycles},
author = {Richard Lang and Oliver Schaudt and Maya Stein},
journal= {arXiv preprint arXiv:1510.00060},
year = {2016}
}
Comments
33 pages