On complete intersection toric ideals of graphs

From MaRDI portal
Publication:364718

DOI10.1007/S10801-012-0406-9zbMATH Open1282.14089arXiv1110.1059OpenAlexW2035871328MaRDI QIDQ364718FDOQ364718


Authors: Christos Tatakis, Apostolos Thoma Edit this on Wikidata


Publication date: 9 September 2013

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

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.


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




Recommendations




Cites Work


Cited In (19)





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)