The polytope of degree partitions

Simple item page
dc.creatorBhattacharya, Amitava
dc.creatorSivasubramanian, S.
dc.creatorSrinivasan, Murali K.
dc.date2005-12-16
dc.date.accessioned2026-07-07T06:55:26Z
dc.date.available2026-07-07T06:55:26Z
dc.descriptionThe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/math/0512402
dc.identifierhttp://arxiv.org/abs/math/0512402
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106275
dc.subjectCombinatorics
dc.subject05c07, 90c27, 90c57
dc.titleThe polytope of degree partitions
dc.typetext

Files

Collections

arXiv