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

      More on Decomposing Coverings by Octants

      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

          In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a 4-fold covering that does not decompose into two coverings. The same bounds also hold for coverings of points in \R2 by finitely many homothets or translates of a triangle. We also prove that certain dynamic interval coloring problems are equivalent to the above question.

          Related collections

          Most cited references8

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

          Coloring half-planes and bottomless rectangles

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

            Octants are cover-decomposable into many coverings

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

              Indecomposable Coverings with Concave Polygons

                Bookmark

                Author and article information

                Journal
                2015-03-05
                2015-11-17
                Article
                1503.01669
                60929e44-eecd-4c05-892a-b8e0cdba8fd5

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                math.CO cs.DM

                Combinatorics,Discrete mathematics & Graph theory
                Combinatorics, Discrete mathematics & Graph theory

                Comments

                Comment on this article