Regularity of powers of edge ideals of some graphs (Q2405027): Difference between revisions

If \(I\) is a homogeneous ideal in a polynomial ring \(R\), then it is known that the regularity of \(I\) is asymptotically linear. If \(I\) is the edge ideal of a graph \(G\), then for sufficiently large \(s\), \(\mathrm{reg}(I)=2s+b\). For select types of graphs, \(b\) has been found as has the power for which the asymptotic bound is reached. For example, if \(G\) is a forest, Beyarslan, Hà, and Trung [\textit{S. Beyarslan} et al., J. Algebr. Comb. 42, No. 4, 1077--1095 (2015; Zbl 1369.13027)] proved that \(\mathrm{reg}(I(G)^s)=2s+\nu(G)-1\) for all \(s \geq 1\) where \(\nu(G)\) is the induced matching number of \(G\). They showed that the same bound holds for a cycle when \(s \geq 2\). This paper extends those results to additional classes of graphs. In particular, if \(G\) is formed by adjoining an ``ear'' to a cycle, in the sense that for some new variable \(y\), edges \({x_i, y}\) and \({x_{i+1}, y}\) are added to the edges of a cycle to form \(G\), then for all \(s \geq 1\), \(\mathrm{reg}(I(G)^s)=2s+\nu(G)-1\). If \(G\) is a bicyclic graph formed from two cycles that share a common vertex, the same bound is shown to hold for \(s \geq 2\) as long as at least one of the cycles has length not equivalent to \(2\) mod \(3\). In both cases, the induced matching number is given in terms of the number of vertices in the cycles, and in the second case, the regularity is given for \(s=1\) and is shown to be between \(2s+\nu(G) -1\) and \(2s+\nu(G)\) for \(s\geq 2\) when both cycles have length equivalent to \(2\) mod \(3\).