On complete intersection toric ideals of graphs

DOI10.1007/S10801-012-0406-9MaRDI QIDQ364718zbMATHOpenAlexFDO

Authors Christos Tatakis, Apostolos Thoma

Publication date 9 September 2013

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graphsbipartite graphscomplete intersectionstoric ideals

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Complete intersections (14M10) Graph theory (05C99) Linkage, complete intersections and determinantal ideals (13C40)

Abstract: We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most two. We prove that toric ideals of graphs which are complete intersections are circuit ideals. The generators of the toric ideal correspond to even cycles of $G$ except of at most one generator, which corresponds to two edge disjoint odd cycles joint at a vertex or with a path. We prove that the blocks of the graph satisfy the odd cycle condition. Finally we characterize all complete intersection toric ideals of graphs which are normal.

Recommendations

• Graphs and complete intersection toric ideals
• Oriented graphs whose toric ideals are a complete intersection
• Ring graphs and complete intersection toric ideals
• Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
• Minimal generators of toric ideals of graphs

Cites work

• scientific article; zbMATH DE number 17664 (Why is no real title available?)
• 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
• 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

Cited in

(19)

• Vertex collapsing and cut ideals
• Toric geometry of series-parallel graphs
• Comparing invariants of toric ideals of bipartite graphs
• On regularity bounds and linear resolutions of toric algebras of graphs
• Acyclic digraphs giving rise to complete intersections
• Generalized robust toric ideals
• On toric ideals arising from signed graphs
• Toric geometry of cuts and splits
• Combinatorial degree bound for toric ideals of hypergraphs
• Graphs and complete intersection toric ideals
• On robustness and related properties on toric ideals
• Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs
• On the universal Gröbner bases of toric ideals of graphs
• Generalized multiplicities of edge ideals
• Green-Lazarsfeld condition for toric edge ideals of bipartite graphs
• Ring graphs and complete intersection toric ideals
• Quadratic-monomial generated domains from mixed signed, directed graphs
• Matroid toric ideals: complete intersection, minors, and minimal systems of generators
• CIO and ring graphs: deficiency and testing

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)