On Complete Intersection toric ideals of graphs

preprint2011arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.