{
  "id": "1307.2411",
  "version": "v2",
  "published": "2013-07-09T11:52:32.000Z",
  "updated": "2014-03-14T10:52:13.000Z",
  "title": "Convex Polygons are Self-Coverable",
  "authors": [
    "Balázs Keszegh",
    "Dömötör Pálvölgyi"
  ],
  "categories": [
    "math.MG",
    "cs.CG",
    "cs.DM",
    "math.CO"
  ],
  "abstract": "We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family with many points contains all colors. This is dual (and in some cases equivalent) to the much investigated cover-decomposability problem.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-03-14T10:52:13.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "convex polygons",
      "self-coverable",
      "cover-decomposability problem",
      "cases equivalent",
      "geometric families"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1307.2411K"
    }
  }
}