The polytope of degree partitions

From MaRDI portal
Publication:2500965

zbMATH Open1100.05022arXivmath/0512402MaRDI QIDQ2500965FDOQ2500965


Authors: Yanyan Li Edit this on Wikidata


Publication date: 30 August 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree sequences) of a fixed length. We think of the degree sequence polytope as the symmetrization of the degree partition polytope and the degree partition polytope as the asymmetric part of the degree sequence polytope. The degree sequence polytope is a well studied object with formulas (generating functions) known for its face numbers, volume, and number of lattice points. We study the degree partition polytope and determine its extreme points, edges, and facets. In particular, the degree partition polytope on n vertices has 2^{n-1} extreme points.


Full work available at URL: https://arxiv.org/abs/math/0512402

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (12)





This page was built for publication: The polytope of degree partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500965)