Improved bounds for the regularity of powers of edge ideals of graphs

Abstract

Let $G$ be a graph with edge ideal $I(G)$. We recall the notions of $\min -matc{h}_{\{K_2,C_5\}}(G)$ and $\ind-match_{\{K_2, C_5\}}(G)$ from \cite{sy}. We show that $$\mathrm{reg}(I(G{)}^s)\le 2s+\min -matc{h}_{\{K_2,C_5\}}(G)-1,$$for all $s\ge 1$, which implies that$$\mathrm{reg}(I(G{)}^s)\le 2s+\min -match(G)-1.$$Moreover, we show that$${\rm reg}(I(G)^s)\geq 2s+\ind-match_{\{K_2, C_5\}}(G)-2,$$and if $\ind-match_{\{K_2, C_5\}}(G)$ is an odd integer, then$${\rm reg}(I(G)^s)\geq 2s+\ind-match_{\{K_2, C_5\}}(G)-1.$$Furthermore, it is shown that$${\rm reg}(I(G)^s)\leq 2s+\ord-match(G)-1,$$where $\ord-match(G)$ denotes the ordered matching number of $G$. Finally, we construct infinitely many connected graphs which satisfy the following strict inequalities:$$2s+\ind-match(G)-1 < {\rm reg}(I(G)^s)< 2s+{\rm cochord}(G)-1.$$This gives a positive answer to a question asked in \cite{jns}.

arXiv commentarXiv admin note: text overlap with arXiv:1705.10226