Journal of Combinatorics

Volume 14 (2023)

Number 3

Colorful graph associahedra

Pages: 369 – 398

DOI: https://dx.doi.org/10.4310/JOC.2023.v14.n3.a4

Authors

Satyan L. Devadoss (University of San Diego, California, U.S.A.)

Mia Smith (University of Michigan, Ann Arbor, Mich., U.S.A.)

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

abstract polytope, graph associahedron

The full text of this article is unavailable through your IP address: 3.145.46.4

Satyan L. Devadoss was partially supported by the John Templeton Foundation grant 51894.

Received 31 August 2021

Published 28 December 2022