Question: Let G be a ring graph with n ≥ 3 vertices and q edges. If G is 2-connected and has no triangles, then q ≤ 2(n - 2) ? Let G be a graph with q edges and P(G) the toric ideal of the edge subring K[G]. If f is a primitive binomial in P(G) prove:
![2141_28.png](https://secure.tutorsglobe.com/CMSImages/2141_28.png)