Minimal generators of toric ideals of graphs
From MaRDI portal
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 .
The authors study the toric ideal \(I_G\) of a general graph \(G\). In particular they characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal \(I_G\). These characterizations are useful in solving problems in the theory of toric ideals of graphs for example to determine the form of the binomials that belong to the universal Gröbner basis of the toric ideal of a graph or to provide a degree bound for the binomials in the Gröbner basis and in the universal Gröbner basis of the toric ideal of a graph.
Recommendations
Cites work
- A geometric definition of combinatorial pure subrings and Gröbner bases of toric ideals of positive roots
- Algebraic algorithms for sampling from conditional distributions
- Arithmetical rank of toric ideals associated to graphs
- Binomial edge ideals and conditional independence statements
- Binomial ideals
- Bipartite graphs whose edge algebras are complete intersections
- Cohen-Macaulay graphs
- Combinatorial Commutative Algebra
- Combinatorial pure subrings.
- Distributive lattices, bipartite graphs and Alexander duality
- Equations Defining Toric Varieties
- Explicit representations of the edge cone of a graph
- Generic lattice ideals
- scientific article; zbMATH DE number 1565322 (Why is no real title available?)
- scientific article; zbMATH DE number 2221719 (Why is no real title available?)
- Ideals and graphs, Gröbner bases and decision procedures in graphs
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Indispensable monomials of toric ideals and Markov bases
- Koszul bipartite graphs
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Monomial and toric ideals associated to Ferrers graphs
- Normal polytopes arising from finite graphs
- On simple \({\mathcal A}\)-multigraded minimal resolutions
- On the equations of the edge cone of a graph and some applications
- On the ideal theory of graphs
- On the universal Gröbner bases of toric ideals of graphs
- Properties of cut ideals associated to ring graphs
- Rees algebras of edge ideals
- Ring graphs and complete intersection toric ideals
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- The integral closure of subrings associated to graphs
- Toric geometry of cuts and splits
- Toric ideals generalized by quadratic binomials
Cited in
(52)- A bound on degrees of primitive elements of toric ideals of graphs
- Bouquet algebra of toric ideals
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Universal Gröbner basis associated with the maximum flow problem
- Binomial ideals of domino tilings
- Hypergraph encodings of arbitrary toric ideals
- Koszul multi-Rees algebras of principal \(L\)-Borel 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
- Toric ideals of simple surface singularities
- 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
- Linear orders of variables for complete graphs
- A Gröbner basis characterization for chordal comparability graphs
- Matroid toric ideals: complete intersection, minors, and minimal systems of generators
- Minimal generators for symmetric ideals
- 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
- Algebraic properties of toric rings of graphs
- Arithmetical rank of toric ideals associated to graphs
- Bounds on the regularity of toric ideals of graphs
- Toric ideals of weighted oriented graphs
- On the relative size of toric bases
- CIO and ring graphs: deficiency and testing
- Toric ideals and cycles
- Regularity and \(h\)-polynomials of toric ideals of graphs
- Toric ideals of finite graphs and adjacent 2-minors
- Betti numbers of toric ideals of graphs: a case study
- Betti numbers of toric algebras of certain bipartite 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
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Divisors on graphs, connected flags, and syzygies
- Universally free numerical semigroups
- Equations of the multi-Rees algebra of fattened coordinate subspaces
- Splittings of toric ideals of graphs
- Generalized multiplicities of edge ideals
- Toric ideals of graphs minimally generated by a Gröbner basis
- Generalized robust toric ideals
- Robust graph ideals
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)
