Skip to main content
Article thumbnail
Location of Repository

A BOUND FOR THE NUMBER OF VERTICES OF A POLYTOPE WITH APPLICATIONS

By Alexander Barvinok

Abstract

Abstract. We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2 Ω(n) vertices and that the number of r-factors in a k-regular graph is exponentially large in the number of vertices of the graph provided k ≥ 2r+1 and every cut in the graph with at least two vertices on each side has more than k/r edges. 1. Introduction an

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.307.9037
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.lsa.umich.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.