Extremal Edge Polytopes

  • Tuan Tran
  • Günter M. Ziegler
DOI: https://doi.org/10.37236/3633
Keywords: 0/1-polytopes, edge polytopes of graphs, subpolytopes of a hypersimplex, extremal f-vectors, number of facets, Turán numbers, pseudorandom graphs

Abstract

The "edge polytope" of a finite graph $G$ is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For $k =2, 3, 5$ we determine the maximal number of vertices of $k$-neighborly edge polytopes up to a sublinear term. We also construct a family of edge polytopes with exponentially-many facets.
Published
2014-06-27
How to Cite
Tran, T., & M. Ziegler, G. (2014). Extremal Edge Polytopes. The Electronic Journal of Combinatorics, 21(2), P2.57. https://doi.org/10.37236/3633
Issue
Volume 21, Issue 2 (2014)
Article Number
P2.57