Browsing by Subject "Ramsey-type problem"
Now showing items 1-1 of 1
-
(Society for Industrial and Applied Mathematics Publications, 2017)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 ...