Satyan L. Devadoss, Mia Smith
Published 2020-11-16Version 1
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.
Comments: 22 pages, 20 figures
Möbius Polynomials of Face Posets of Convex Polytopes
Schroder combinatorics and $ν$-associahedra
On the Facets of the Secondary Polytope
![QR code for arXiv:2011.08169 [math.CO]](http://oss.arxitics.com/images/favicon.svg)