19
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Almost partitioning a 3-edge-coloured \(K_{n,n}\) into 5 monochromatic cycles

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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 and 18 disjoint monochromatic cycles which together cover all vertices.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Article: not found

          Blow-up Lemma

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Vertex coverings by monochromatic paths and cycles

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Partitioning Complete Bipartite Graphs by Monochromatic Cycles

                Bookmark

                Author and article information

                Journal
                1510.00060

                Combinatorics
                Combinatorics

                Comments

                Comment on this article