2 problems

For each $n$, consider the set of unlabelled isomorphism classes of trees with $n$ nodes. For a tree $T$, let $\mathcal{B}(T)$ be its graphical building set and let…

A graphical nested complex is associated with a graph, and its primal and dual compatibility fans are the fans constructed from the corresponding compatibility data. Polytopality c…