The numbers of edges of the order polytope and the chain poyltope of a finite partially ordered set

preprint2016arXivOpen access

Abstract

Let PP be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope O(P){\mathcal O}(P) is equal to that of the chain polytope C(P){\mathcal C}(P). Furthermore, it will be shown that the degree sequence of the finite simple graph which is the 11-skeleton of O(P){\mathcal O}(P) is equal to that of C(P){\mathcal C}(P) if and only if O(P){\mathcal O}(P) and C(P){\mathcal C}(P) are unimodularly equivalent.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.