A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
GOTZMANN IDEALS AND APPLICATIONS TO GRAPHS II
2007
unpublished
Let k be an infinite field and S = k[x 1 ,. .. , x n ] the polynomial ring over k with each degx i = 1 and m = (x 1 ,. .. , x n) the graded maximal ideal of S. A graded ideal I generated in degree d is called a Gotzmann ideal if the number of generators of mI is the smallest possible, namely, equal to the number of generators of (mI) lex. A graph G is called Gotzmann if the edge ideal I(G) is a Gotzmann ideal. We determine some classes of Gotzmann graphs and we characterize all Cohen-Macaulay graphs which are Gotzmann and principal Borel.
fatcat:hrslcxdyevcxrhtt24kfb2atl4