
arXiv: 1307.6708
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.
Extremal problems in graph theory, subpolytopes of a hypersimplex, extremal f-vectors, Metric Geometry (math.MG), number of facets, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.), pseudorandom graphs, 0/1-polytopes, Mathematics - Metric Geometry, Special polytopes (linear programming, centrally symmetric, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), edge polytopes of graphs, Turán numbers
Extremal problems in graph theory, subpolytopes of a hypersimplex, extremal f-vectors, Metric Geometry (math.MG), number of facets, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.), pseudorandom graphs, 0/1-polytopes, Mathematics - Metric Geometry, Special polytopes (linear programming, centrally symmetric, etc.), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), edge polytopes of graphs, Turán numbers
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
