Binomial edge ideals with quadratic Gröbner bases (Q648403)

Given a simple undirected graph \(G\) on \([n]\), the binomial edge ideal associated to \(G\) is the ideal \(J_G \subset S=K[x_1, \ldots, x_n, y_1, \ldots, y_n]\) generated by the binomials \(x_iy_j - x_jy_i\) for each edge \(\{i,j\}\) in \(G\). These ideals were introduced by \textit{J. Herzog, T. Hibi, F. Hreinsdóttir, T. Kahle}, and \textit{J. Rauh} [Adv. Appl. Math. 45, No. 3, 317--333 (2010; Zbl 1196.13018)], wherein they proved that \(J_G\) has a quadratic Gröbner basis under the lexicographic order if and only if \(G\) is closed, i.e., the edges satisfy a simple but technical condition, with respect to the given labeling of the vertices. These ideals were also independently studied by \textit{M. Ohtani} [Commun. Algebra 39, No. 3, 905--917 (2011; Zbl 1225.13028)]. The authors define a graph to be closed if it is closed with respect to some labeling of the vertices. They prove that a graph is closed if and only if its binomial edge ideal has a quadratic Gröbner basis with respect to some term order. Moreover, the authors show that closedness of a graph is characterized by its clique complex, although an order on the facets of the clique complex must then be considered.