Polytopes with low excess degree
Guillermo Pineda-Villavicencio, Jie Wang, and David Yost

TL;DR
This paper investigates the structure and existence of $d$-polytopes with low excess degree, revealing new constraints on possible edge-vertex configurations and establishing structural properties for specific excess degrees.
Contribution
It provides new bounds on the excess degree of $d$-polytopes and characterizes their structure for certain excess degrees, extending previous results.
Findings
Excess degree cannot lie in [d+3, 2d-7] range.
Many pairs (f0, f1) are not realizable by any polytope.
Structural results for excess degrees d, d+2, and 2d-6.
Abstract
We study the existence and structure of -polytopes for which the number of edges is small compared to the number of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as . We show that the excess degree of a -polytope cannot lie in the range , complementing the known result that values in the range are impossible. In particular, many pairs are not realised by any polytope. For -polytopes with excess degree , strong structural results are known; we establish comparable results for excess degrees , , and . Frequently, in polytopes with low excess degree, say at most , the nonsimple vertices all have the same degree and they form either a face or a missing face. We show that excess degree is possible only for , or , complementing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · graph theory and CDMA systems
