Extremal edge polytopes
Combinatorics
2014-06-30 v2 Metric Geometry
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 maximum 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.
Keywords
Cite
@article{arxiv.1307.6708,
title = {Extremal edge polytopes},
author = {Tuan Tran and Günter M. Ziegler},
journal= {arXiv preprint arXiv:1307.6708},
year = {2014}
}
Comments
Final version; 16 pages, 3 figures. Published in The Electronic Journal of Combinatorics