Abstract. Let G be a finite graph on the vertex set [d] = {1, . . . , d} with the edges e1, . . . , en and K[t] = K[t1, . . . , t d ] the polynomial ring in d variables over a field K. The edge ring of G is the semigroup ring K[G] which is generated by those monomials t e = titj such that e = {i, j} is an edge of G.. . , xn] be the polynomial ring in n variables over K and define the surjective homomorphism π :by setting π(xi) = t e i for i = 1, . . . , n. The toric ideal IG of G is the kernel of π. It will be proved that, given integers f and d with 6 ≤ f ≤ d, there exist a finite connected nonbipartite graph G on [d] together with a reverse lexicographic order