Abstract
Let P be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope 풪(P) is equal to that of the chain polytope C(P). Furthermore, it will be shown that the degree sequence of the finite simple graph which is the 1-skeleton of 풪(P) is equal to that of C(P) if and only if 풪(P) and C(P) are unimodularly equivalent.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
