We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
No takes yet. Share an insight, caveat, or question.
Crupı et al. (2011) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: