Minimal generators of toric ideals of graphs

DOI10.1016/j.aam.2011.06.003zbMath1266.14041arXiv1002.2045MaRDI QIDQ651047

Apostolos Thoma, Enrique Reyes, Christos Tatakis

Publication date: 8 December 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.2045

zbMATH Keywords

toric varieties; toric ideals; graphs; Graver basis; indispensable binomials

Mathematics Subject Classification ID

14M25: Toric varieties, Newton polyhedra, Okounkov bodies

05C38: Paths and cycles

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

Algebraic properties of toric rings of graphs, On the relative size of toric bases, Betti numbers of toric ideals of graphs: A case study, Betti numbers of toric algebras of certain bipartite graphs, Universally free numerical semigroups, A Gröbner basis characterization for chordal comparability graphs, Toric ideals and their circuits, On complete intersection toric ideals of graphs, Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs, Markov complexity of monomial curves, Bounds on the regularity of toric ideals of graphs, CIO and ring graphs: deficiency and testing, On the universal Gröbner bases of toric ideals of graphs, Generalized multiplicities of edge ideals, Generalized robust toric ideals, Robust graph ideals, Bouquet algebra of toric ideals, Graver basis for an undirected graph and its application to testing the beta model of random graphs, Binomial ideals of domino tilings, Hypergraph encodings of arbitrary toric ideals, On toric ideals arising from signed graphs, Edge rings with \(q\)-linear resolutions, On the strongly robust property of toric ideals, Graver degrees are not polynomially bounded by true circuit degrees, Rees algebras of square-free monomial ideals, Ring index of a graph, Toric ideals associated with gap-free graphs, Toric algebra of hypergraphs, The Markov complexity of book graphs, On robustness and related properties on toric ideals, COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS, On the binomial arithmetical rank of toric ideals, Graphs and complete intersection toric ideals, A survey of discrete methods in (algebraic) statistics for networks, Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the universal Gröbner bases of toric ideals of graphs
• Toric geometry of cuts and splits
• Properties of cut ideals associated to ring graphs
• Indispensable monomials of toric ideals and Markov bases
• Ring graphs and complete intersection toric ideals
• Binomial edge ideals and conditional independence statements
• Normal polytopes arising from finite graphs
• On the equations of the edge cone of a graph and some applications
• Koszul bipartite graphs
• Toric ideals generalized by quadratic binomials
• On the ideal theory of graphs
• The integral closure of subrings associated to graphs
• Combinatorial pure subrings.
• Algebraic algorithms for sampling from conditional distributions
• Cohen-Macaulay graphs
• Bipartite graphs whose edge algebras are complete intersections
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Binomial ideals
• Ideals and graphs, Gröbner bases and decision procedures in graphs
• Distributive lattices, bipartite graphs and Alexander duality
• Non-very ample configurations arising from contingency tables
• Monomial and toric ideals associated to Ferrers graphs
• Equations Defining Toric Varieties
• Generic lattice ideals
• Combinatorial Commutative Algebra
• Rees algebras of edge ideals
• Arithmetical rank of toric ideals associated to graphs
• Explicit representations of the edge cone of a graph
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• On simple A-multigraded minimal resolutions