Generalized cover ideals and the persistence property

Let $I$ be a square-free monomial ideal in $R = k[x_1,\ldots,x_n]$, and consider the sets of associated primes ${\rm Ass}(I^s)$ for all integers $s \geq 1$. Although it is known that the sets of associated primes of powers of $I$ eventually stabilize, there are few results about the power at which this stabilization occurs (known as the index of stability). We introduce a family of square-free monomial ideals that can be associated to a finite simple graph $G$ that generalizes the cover ideal construction. When $G$ is a tree, we explicitly determine ${\rm Ass}(I^s)$ for all $s \geq 1$. As consequences, not only can we compute the index of stability, we can also show that this family of ideals has the persistence property.Comment: 15 pages; revised version has a new introduction; references updated; to appear in J. Pure. Appl. Algebr

Powers of Hamilton cycles in pseudorandom graphs

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$ with $|X|\ge\varepsilon p^kn$ and $|Y|\ge\varepsilon p^\ell n$ we have $e(X,Y)=(1\pm\varepsilon)p|X||Y|$. We prove that for all $\beta>0$ there is an $\varepsilon>0$ such that an $(\varepsilon,p,1,2)$-pseudorandom graph on $n$ vertices with minimum degree at least $\beta pn$ contains the square of a Hamilton cycle. In particular, this implies that $(n,d,\lambda)$-graphs with $\lambda\ll d^{5/2 }n^{-3/2}$ contain the square of a Hamilton cycle, and thus a triangle factor if $n$ is a multiple of $3$. This improves on a result of Krivelevich, Sudakov and Szab\'o [Triangle factors in sparse pseudo-random graphs, Combinatorica 24 (2004), no. 3, 403--426]. We also extend our result to higher powers of Hamilton cycles and establish corresponding counting versions.Comment: 30 pages, 1 figur

Regularity of Edge Ideals and Their Powers

We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals of graphs and their powers. Our focus is on bounds and exact values of $\text{ reg } I(G)$ and the asymptotic linear function $\text{ reg } I(G)^q$, for $q \geq 1,$ in terms of combinatorial data of the given graph $G.$Comment: 31 pages, 15 figure