Orvium CommunityPosted by the community
article
Simple polytopes arising from finite graphs
27 Apr 2008
| By
 Hidefumi Hidefumi Ohsugi
 Takayuki Takayuki Hibi
21 Views
0 Comments
Version 1
Discipline
Keywords
Abstract
Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that the toric ideals $I_G$ of $G$ possesses a quadratic Gr\"obner basis if the edge polytope ${\cal P}_G$ of $G$ is simple. It is also shown that, for a finite graph $G$, the edge polytope is simple but not a simplex if and only if it is smooth but not a simplex. Moreover, the Ehrhart polynomial and the normalized volume of simple edge polytopes are computed. Comment: 11 pages
Submitted by
User Avatar
Antonio Romero
Orvium

No comments published yet.

Details
Published
add_link
Indexed by
OpenAIRE
OpenAIRE
Submitted by27 Apr 2008
User Avatar
Antonio Romero
Orvium
Citation:

Ohsugi, . & Hibi, . (2008). Simple polytopes arising from finite graphs. Orvium Community.