Colorful Graph Associahedra
Combinatorics
2020-11-17 v1
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.
Keywords
Cite
@article{arxiv.2011.08169,
title = {Colorful Graph Associahedra},
author = {Satyan L. Devadoss and Mia Smith},
journal= {arXiv preprint arXiv:2011.08169},
year = {2020}
}
Comments
22 pages, 20 figures