Browsing by Author "e008a132-ff2e-4d68-ae9b-d8a045af7cd4"

Now showing items 1-3 of 3

    • Almost partitioning A 3-edge-colored Kn,n into five monochromatic cycles 
      Lang, Richard; Schaudt, Oliver; Stein, Maya (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 ...
    • Local colourings and monochromatic partitions in complete bipartite graphs 
      Lang, Richard; Stein, Maya (Academic Press- Elsevier, 2017)
      We show that for any 2-local colouring of the edges of the balanced complete bipartite graph Kn,n, its vertices can be covered with at most 3 disjoint monochromatic paths. And, we can cover almost all vertices of any ...
    • Monochromatic cycle partitions 
      Lang, Richard Johannes (Universidad de Chile, 2017)
      The first part of this thesis concerns monochromatic cycle partitions. We make the following three contributions. Our first result is that for any colouring of the edges of the complete bipartite graph $K_{n,n}$ with 3 ...