We prove that a binomial edge ideal of a graph G has a quadratic Groebner 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.
Binomial edge ideals with quadratic Groebner bases
CRUPI, Marilena;RINALDO, GIANCARLO
2011-01-01
Abstract
We prove that a binomial edge ideal of a graph G has a quadratic Groebner 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
