1 problem
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…
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…