Extremal edge polytopes (Q405274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal edge polytopes |
scientific article; zbMATH DE number 6340224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal edge polytopes |
scientific article; zbMATH DE number 6340224 |
Statements
Extremal edge polytopes (English)
0 references
4 September 2014
0 references
Summary: 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.
0 references
0/1-polytopes
0 references
edge polytopes of graphs
0 references
subpolytopes of a hypersimplex
0 references
extremal f-vectors
0 references
number of facets
0 references
Turán numbers
0 references
pseudorandom graphs
0 references
0.8095068335533142
0 references
0.789208710193634
0 references
0.7653822898864746
0 references
