On complete intersection toric ideals of graphs

From MaRDI portal



Abstract: We characterize the graphs G for which their toric ideals IG are complete intersections. In particular we prove that for a connected graph G such that IG 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.


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.











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)