The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set (Q512575)

In a seminal paper [Discrete Comput. Geom. 1, 9--23 (1986; Zbl 0595.52008)], \textit{R. Stanley} introduced two natural polytopes associated to a given finite poset \((P, \preceq)\): the \textit{order polytope} \[ O(P) \;:= \;\left\{ x \in {\mathbb R}^P : \, 0 \leq x_j \leq 1, \;x_j \geq x_k \text{ whenever } j \preceq k \text{ in } P \right\} \] and the \textit{chain polytope} \[ C(P) \;:= \;\left\{ x \in {\mathbb R}_{ \geq 0 }^P : {{ x_{ j_1 } + x_{ j_2 } + \cdots + x_{ j_k } \leq 1 \text{ for every} } \atop { \text{ maximal chain } j_1 \prec j_2 \prec \cdots \prec j_k }} \right\} . \] The paper under review continues the work of two previous articles [the first two authors, ``Cutting convex polytopes by hyperplanes'', Preprint, \url{arXiv:1402.3805}; Math. Scand. 118, No. 1, 5--12 (2016; Zbl 1335.52026)]. The two main results say that \(O(P)\) and \(C(P)\) have the same number of edges, and their graphs (1-skeleta) have the same degree sequence if and only if \(O(P)\) and \(C(P)\) are related by a unimodular transformation followed by an integer translation.