Abstract
The convex polytopes arising from finite graphs and their toric ideals have been studied by many authors. The present chapter is devoted to introducing the foundation on the topics. In Section 5.1, we summarize basic terminologies on finite graphs. A basic fact on bipartite graphs is proved. The edge polytope of a finite graph is introduced in Section 5.2. We study the dimension, the vertices, the edges, and the facets of edge polytopes. In Section 5.3, the edge ring of a finite graph and its toric ideal is discussed. One of the main results is a combinatorial characterization for the toric ideal of an edge ring to be generated by quadratic binomials (Theorem 5.14). The problem of the normality of edge polytopes is studied in Section 5.4. It turns out that the odd cycle condition in the classical graph theory characterizes the normality of an edge polytope. Furthermore, it is shown that an edge polytope is normal if and only if it possesses a unimodular covering (Theorem 5.20). Finally, in Section 5.5, Gröbner bases of toric ideals arising from bipartite graphs will be discussed. In particular, we show that the toric ideal of the edge ring of a bipartite graph is generated by quadratic binomials if and only if it possesses a quadratic Gröbner basis (Theorem 5.27).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
D’Alì, A.: Toric ideals associated with gap-free graphs. J. Pure Appl. Algebra 219, 3862–3872 (2015)
De Loera, A., Sturmfels, B., Thomas, R.: Gröbner bases and triangulations of the second hypersimplex. Combinatorica 15, 409–424 (1995)
Fulkerson, D.R., Hoffman, A.J., McAndrew, M.H.: Some properties of graphs with multiple edges. Can. J. Math. 17, 166–177 (1965)
Gitler, I., Reyes, E., Villarreal, R.H.: Ring graphs and complete intersection toric ideals. Discret. Math. 310 430–441 (2010)
Hibi, T., Li, N., Zhang, Y.X.: Separating hyperplanes of edge polytopes. J. Comb. Theory Ser. A 120, 218–231 (2013)
Hibi, T., Matsuda, K., Ohsugi, H.: Strongly Koszul edge rings. Acta Math. Vietnam. 41, 69–76 (2016)
Hibi, T., Mori, A., Ohsugi, H., Shikama, A.: The number of edges of the edge polytope of a finite simple graph. ARS Mat. Contemp. 10, 323–332 (2016)
Hibi, T., Nishiyama, K., Ohsugi, H., Shikama, A.: Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases. J. Algebra 408, 138–146 (2014)
Hochster, M.: Rings of invariants of tori, Cohen–Macaulay rings generated by monomials, and polytopes. Ann. Math. 96, 318–337 (1972)
Katzman, M.: Bipartite graphs whose edge algebras are complete intersections. J. Algebra 220, 519–530 (1999)
Ogawa, M., Hara, H., Takemura A.: Graver basis for an undirected graph and its application to testing the beta model of random graphs. Ann. Inst. Stat. Math. 65, 191–212 (2013)
Ohsugi, H.: Toric ideals and an infinite family of normal (0,1)-polytopes without unimodular regular triangulations. Discret. Comput. Geom. 27, 551–565 (2002)
Ohsugi, H., Hibi, T.: Normal polytopes arising from finite graphs. J. Algebra 207, 409–426 (1998)
Ohsugi, H., Hibi, T.: A normal (0, 1)-polytope none of whose regular triangulations is unimodular. Discret. Comput. Geom. 21, 201–204 (1999)
Ohsugi, H., Hibi, T.: Toric ideals generated by quadratic binomials. J. Algebra 218, 509–527 (1999)
Ohsugi, H., Hibi, T.: Koszul bipartite graphs. Adv. Appl. Math. 22, 25–28 (1999)
Ohsugi, H., Hibi, T.: Compressed polytopes, initial ideals and complete multipartite graphs. Ill. J. Math. 44, 391–406 (2000)
Ohsugi, H., Hibi, T.: Indispensable binomials of finite graphs. J. Algebra Appl. 4, 421–434 (2005)
Ohsugi, H., Hibi, T.: Special simplices and Gorenstein toric rings. J. Comb. Theory Ser. A 113, 718–725 (2006)
Ohsugi, H., Hibi, T.: Simple polytopes arising from finite graphs. In: Dehmer, M., Drmota, M., Emmert-Streib, F. (eds.) Proceedings of the 2008 International Conference on Information Theory and Statistical Learning (ITSL 2008), pp. 73–79. CSREA Press, Las Vegas (2008)
Ohsugi, H., Hibi, T.: Toric ideals and their circuits. J. Commut. Algebra 5, 309–322 (2013)
Reyes, E., Tatakis, C., Thoma, A.: Minimal generators of toric ideals of graphs. Adv. Appl. Math. 48, 64–78 (2012)
Simis, A., Vasconcelos, W.V., Villarreal, R.H.: On the ideal theory of graphs. J. Algebra 167, 389–416 (1994)
Simis, A., Vasconcelos, W.V., Villarreal, R.H.: The integral closure of subrings associated to graphs. J. Algebra 199, 281–289 (1998)
Sturmfels, B.: Gröbner Bases and Convex Polytopes. American Mathematical Society, Providence (1996)
Tatakis, C., Thoma, A.: On the Universal Gröbner bases of toric ideals of graphs. J. Combin. Theory Ser. A 118, 1540–1548 (2011)
Tatakis, C., Thoma, A.: On complete intersection toric ideals of graphs. J. Algebr. Combin. 38, 351–370 (2013)
Tran, T., Ziegler, G.M.: Extremal edge polytopes. Electron. J. Combin. 21, P2.57 (2014)
Villarreal, R.: Rees algebras of edge ideals. Commun. Algebra 23, 3513–3524 (1995)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Herzog, J., Hibi, T., Ohsugi, H. (2018). Edge Polytopes and Edge Rings. In: Binomial Ideals. Graduate Texts in Mathematics, vol 279. Springer, Cham. https://doi.org/10.1007/978-3-319-95349-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-95349-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95347-2
Online ISBN: 978-3-319-95349-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)