Almost partitioning a 3-edge-coloured K_(n,n) into 5 monochromatic cycles
classification
🧮 math.CO
keywords
cyclesmonochromaticcoverdisjointtogetherverticesalmostbipartite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.