Almost complete intersection binomial edge ideals and their Rees algebras (Q1996065)

Let \(G\) be a graph on \(n\) vertices and \(J_G\) be the binomial edge ideal in the polynomial ring \(S=K[x_1,\ldots,x_n,y_1,\ldots,y_n]\), where \(K\) is a field. The authors study the graphs whose binomial edge ideals are almost complete intersection. They show that if \(G\) is a tree and not a path, then \(J_G\) is an almost complete intersection iff \(G\) is obtained by adding an edge between two vertices of two paths and if \(G\) is connected and not a tree, then \(J_G\) is an almost complete intersection iff \(G\) is obtained by adding an edge between two vertices of a path or by adding a path to each vertex of \(C_3\). It is also shown that if \(J_G\) is almost complete intersection, then the form ring \(gr_S(J_G)\) and the Rees ring \(R_S(J_G)\) are both Cohen-Macaulay.