Minimal generators of toric ideals of graphs
From MaRDI portal
Publication:651047
DOI10.1016/J.AAM.2011.06.003zbMATH Open1266.14041arXiv1002.2045OpenAlexW2092477090MaRDI QIDQ651047FDOQ651047
Authors: Enrique Reyes, Christos Tatakis, Apostolos Thoma 
Publication date: 8 December 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Abstract: Let be the toric ideal of a graph . We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal .
Full work available at URL: https://arxiv.org/abs/1002.2045
Recommendations
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)
Cites Work
- Normal polytopes arising from finite graphs
- Koszul bipartite graphs
- Toric ideals generalized by quadratic binomials
- Combinatorial pure subrings.
- Cohen-Macaulay graphs
- Distributive lattices, bipartite graphs and Alexander duality
- Title not available (Why is that?)
- Combinatorial Commutative Algebra
- Equations Defining Toric Varieties
- Binomial ideals
- Algebraic algorithms for sampling from conditional distributions
- Rees algebras of edge ideals
- Properties of cut ideals associated to ring graphs
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Generic lattice ideals
- Ring graphs and complete intersection toric ideals
- The integral closure of subrings associated to graphs
- Bipartite graphs whose edge algebras are complete intersections
- Arithmetical rank of toric ideals associated to graphs
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- On the universal Gröbner bases of toric ideals of graphs
- Monomial and toric ideals associated to Ferrers graphs
- On the ideal theory of graphs
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- On simple \({\mathcal A}\)-multigraded minimal resolutions
- Toric geometry of cuts and splits
- On the equations of the edge cone of a graph and some applications
- Explicit representations of the edge cone of a graph
- A geometric definition of combinatorial pure subrings and Gröbner bases of toric ideals of positive roots
- Binomial edge ideals and conditional independence statements
- Ideals and graphs, Gröbner bases and decision procedures in graphs
- Title not available (Why is that?)
- Indispensable monomials of toric ideals and Markov bases
Cited In (50)
- On the universal Gröbner bases of toric ideals of graphs
- Toric ideals and cycles
- Markov complexity of monomial curves
- Universally free numerical semigroups
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- On robustness and related properties on toric ideals
- Regularity and \(h\)-polynomials of toric ideals of graphs
- A bound on degrees of primitive elements of toric ideals of graphs
- Matroid toric ideals: complete intersection, minors, and minimal systems of generators
- A survey of discrete methods in (algebraic) statistics for networks
- Toric algebra of hypergraphs
- Generalized multiplicities of edge ideals
- Combinatorial degree bound for toric ideals of hypergraphs
- Koszul multi-Rees algebras of principal \(L\)-Borel ideals
- On the binomial arithmetical rank of toric ideals
- Graphs and complete intersection toric ideals
- Binomial ideals of domino tilings
- On toric ideals arising from signed graphs
- Bouquet algebra of toric ideals
- Generalized robust toric ideals
- Robust graph ideals
- Graver degrees are not polynomially bounded by true circuit degrees
- Rees algebras of square-free monomial ideals
- Toric ideals associated with gap-free graphs
- Hypergraph encodings of arbitrary toric ideals
- Universal Gröbner basis associated with the maximum flow problem
- Minimal generators for symmetric ideals
- Toric ideals of simple surface singularities
- Algebraic properties of toric rings of graphs
- On the strongly robust property of toric ideals
- Ring index of a graph
- Toric ideals of finite graphs and adjacent 2-minors
- Edge rings with \(q\)-linear resolutions
- Equations of the multi-Rees algebra of fattened coordinate subspaces
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Linear orders of variables for complete graphs
- The Markov complexity of book graphs
- Arithmetical rank of toric ideals associated to graphs
- A Gröbner basis characterization for chordal comparability graphs
- Betti numbers of toric algebras of certain bipartite graphs
- Toric ideals and their circuits
- Toric ideals of weighted oriented graphs
- Bounds on the regularity of toric ideals of graphs
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- On complete intersection toric ideals of graphs
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
- Divisors on graphs, connected flags, and syzygies
- On the relative size of toric bases
- CIO and ring graphs: deficiency and testing
- Betti numbers of toric ideals of graphs: a case study
This page was built for publication: Minimal generators of toric ideals of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651047)
