{
  "id": "2011.08169",
  "version": "v1",
  "published": "2020-11-16T18:48:51.000Z",
  "updated": "2020-11-16T18:48:51.000Z",
  "title": "Colorful Graph Associahedra",
  "authors": [
    "Satyan L. Devadoss",
    "Mia Smith"
  ],
  "comment": "22 pages, 20 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a collection of simple abstract polytopes, and explore its properties.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-11-16T18:48:51.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52B11",
      "06A07",
      "05B30"
    ],
    "keywords": [
      "colorful graph associahedron",
      "simple convex polytope",
      "simple abstract polytopes",
      "face poset",
      "additional assignment"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}