Geodesic
Gorenstein polytopes obtained from bipartite graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Beck et al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et al. also gave a method to construct an infinite family of Gorenstein polytopes. In this paper, we introduce a new class of polytopes obtained from graphs and we extend their method to construct many more Gorenstein polytopes.
DOI : 10.37236/280
Classification : 52B20, 05C99, 68Q80
Mots-clés : Gorenstein polytopes, perfect matching polytopes, torus graphs, bi-partite graphs 
@article{10_37236_280,
     author = {Makoto Tagami},
     title = {Gorenstein polytopes obtained from bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/280},
     zbl = {1194.52013},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/280/}
}
TY  - JOUR
AU  - Makoto Tagami
TI  - Gorenstein polytopes obtained from bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/280/
DO  - 10.37236/280
ID  - 10_37236_280
ER  - 
%0 Journal Article
%A Makoto Tagami
%T Gorenstein polytopes obtained from bipartite graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/280/
%R 10.37236/280
%F 10_37236_280
Makoto Tagami. Gorenstein polytopes obtained from bipartite graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/280

Cité par Sources :