Minimal generators of toric ideals of graphs

Abstract

Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.

References in corpus (2)

• Binomial edge ideals and conditional independence statements
• Arithmetical rank of toric ideals associated to graphs

Cited by in corpus (3)

• On the universal Gröbner bases of toric ideals of graphs
• Graver basis for an undirected graph and its application to testing the beta model of random graphs
• On Complete Intersection toric ideals of graphs