Almost partitioning A 3-edge-colored Kn,n into five monochromatic cycles
Almost-partitioning-a-3-edge-coloured-Knn.pdf (429.3Kb)Abstract
We show that for any coloring of the edges of the complete bipartite graph Kn,n with three colors there are five 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.
Indexation
Artículo de publicación SCOPUS
Identifier
URI: https://repositorio.uchile.cl/handle/2250/168896
DOI: 10.1137/15M104222X
ISSN: 08954801
Quote Item
SIAM Journal on Discrete Mathematics, Volumen 31, Issue 2, 2017, Pages 1374-1402
Collections
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile