On complete intersection toric ideals of graphs
In the paper under review the authors try to characterize complete intersection toric ideals of a general simple graph \(G\). It is clear that they can assume the graph connected. A cut vertex of \(G\) is a vertex such that when you deleted it, \(G\) becomes disconnect. A connected subgraph without cut points is called a block. The main result in this paper is: If the toric ideal \(I_G\) associated to the graph \(G\) is a complete intersection then at most two blocks of \(G\) are non bipartite. Moreover the toric ideal \(I_G\) is generated by circuits.
- Affine semigroup rings that are complete intersections
- Algebras arising from bipartite planar graphs
- Bipartite graphs whose edge algebras are complete intersections
- Complete intersection lattice ideals
- Generators and relations of abelian semigroups and semigroup rings
- Graphs and complete intersection toric ideals
- scientific article; zbMATH DE number 17664 (Why is no real title available?)
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Minimal generators of toric ideals of graphs
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Mixed matrices and binomial ideals
- Normal polytopes arising from finite graphs
- On regular sequences of binomials
- On the jacobian module associated to a graph
- Rees algebras of edge ideals
- Ring graphs and complete intersection toric ideals
- Ring graphs and toric ideals
- Some Properties of Graphs with Multiple Edges
- The circuit ideal of a vector configuration
- The integral closure of subrings associated to graphs
- Toric ideals generated by circuits
- Acyclic digraphs giving rise to complete intersections
- On toric ideals arising from signed graphs
- On regularity bounds and linear resolutions of toric algebras of graphs
- Green-Lazarsfeld condition for toric edge ideals of bipartite graphs
- On robustness and related properties on toric ideals
- Combinatorial degree bound for toric ideals of hypergraphs
- Graphs and complete intersection toric ideals
- Matroid toric ideals: complete intersection, minors, and minimal systems of generators
- Toric geometry of series-parallel graphs
- Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
- CIO and ring graphs: deficiency and testing
- Vertex collapsing and cut ideals
- On the universal Gröbner bases of toric ideals of graphs
- Quadratic-monomial generated domains from mixed signed, directed graphs
- Comparing invariants of toric ideals of bipartite graphs
- Generalized multiplicities of edge ideals
- Toric ideals of graphs minimally generated by a Gröbner basis
- Toric geometry of cuts and splits
- Generalized robust toric ideals
- Ring graphs and complete intersection toric ideals
This page was built for publication: On complete intersection toric ideals of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364718)