Graph explorer

Extremal edge polytopes

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.

5 nodes4 linksoverview mapExtremal edge polytopes
5 nodes4 links
Extremal edge polytopes5 visible / 5 total nodes / 5 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalWExtremal edge polytopespreprint / 2014ATuan TranResearcherAGünter M. ZieglerResearcherTmath.CO8936 worksTmath.MG1407 works
PaperSignal 104 links

Extremal edge polytopes

preprint / 2014

Open