2000 character limit reached
On the Castelnuovo-Mumford regularity of squarefree powers of edge ideals (2207.08559v1)
Published 18 Jul 2022 in math.AC and math.CO
Abstract: Assume that $G$ is a graph with edge ideal $I(G)$ and matching number ${\rm match}(G)$. For every integer $s\geq 1$, we denote the $s$-th squarefree power of $I(G)$ by $I(G){[s]}$. It is shown that for every positive integer $s\leq {\rm match}(G)$, the inequality ${\rm reg}(I(G){[s]})\leq {\rm match}(G)+s$ holds provided that $G$ belongs to either of the following classes: (i) very well-covered graphs, (ii) semi-Hamiltonian graphs, or (iii) sequentially Cohen-Macaulay graphs. Moreover, we prove that for every Cameron-Walker graph $G$ and for every positive integer $s\leq {\rm match}(G)$, we have ${\rm reg}(I(G){[s]})={\rm match}(G)+s$