An algorithm for computing the universal Grobner Basis of graph ideals

摘要

The universal Grobner basis of an ideal is a Grobner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Grobner basis for the toric ideal corresponding to an undirected graph, based on the theoretical knowledge of this set and on a recent, efficiently computable algorithmic characterization of the Graver basis of the ideal.