Geodesic
Extremal edge polytopes
Tuan Tran1 ; Günter M. Ziegler1
1Institute of Mathematics, Freie Universität Berlin
The electronic journal of combinatorics, Tome 21 (2014) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/3633
Classification : 05C35, 52B05, 52B12
Mots-clés : 0/1-polytopes, edge polytopes of graphs, subpolytopes of a hypersimplex, extremal f-vectors, number of facets, Turán numbers, pseudorandom graphs

Tuan Tran  1   ; Günter M. Ziegler  1

1 Institute of Mathematics, Freie Universität Berlin 
@article{10_37236_3633,
     author = {Tuan Tran and G\"unter M. Ziegler},
     title = {Extremal edge polytopes},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {2},
     doi = {10.37236/3633},
     zbl = {1300.05145},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3633/}
}
TY  - JOUR
AU  - Tuan Tran
AU  - Günter M. Ziegler
TI  - Extremal edge polytopes
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3633/
DO  - 10.37236/3633
ID  - 10_37236_3633
ER  - 
%0 Journal Article
%A Tuan Tran
%A Günter M. Ziegler
%T Extremal edge polytopes
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/3633/
%R 10.37236/3633
%F 10_37236_3633
Tuan Tran; Günter M. Ziegler. Extremal edge polytopes. The electronic journal of combinatorics, Tome 21 (2014) no. 2. doi: 10.37236/3633

Cité par Sources :