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

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Syzygies, resolutions, complexes and commutative rings (13D02) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Abstract: Let

G

be a finite simple graph and

I (G)

denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of

I (G)^{q}

in terms of certain combinatorial invariants associated with

G

. We also prove a weaker version of a conjecture by Alilooee, Banerjee, Beyarslan and H`a on an upper bound for the regularity of

I (G)^{q}

and we prove the conjectured upper bound for the class of vertex decomposable graphs. Using these results, we explicitly compute the regularity of

I (G)^{q}

for several classes of graphs.

Review text

Let \(G\) be a finite simple graph, \(I(G)\) the quadratic monomial ideal generated by its edges in \(K[V(G)]\). The purpose of this paper is to study upper bounds on the Castelnuovo-Mumford regularity \(\mathrm{reg}(I(G)^q)\). It is well known that \(\mathrm{reg}(I(G)^q)=2q+b\) for large \(q\), where \(b\) depends on \(I(G)\). One of the two main results in this interesting paper is Theorem 4.4. Theorem 4.4. For all \(q\geq 1\) we have \begin{itemize} \item \(\mathrm{reg}(I(G)^q)\leq 2q+\zeta (G)-1\) \item \(\mathrm{reg}(I(G)^q)\leq 2q+\mathrm{co-chord} (G)-1\) \end{itemize} The definitions of \(\zeta (G), \mathrm{co-chord} (G)\) are rather technical, please refer to section 4 of the paper. The second main result is Theorem 5.3. Theorem 5.3. If \(G\) is vertex decomposable graph, then for all \(q\geq 1\) we have \[\mathrm{reg}(I(G)^q)\leq 2q+\mathrm{reg} (I(G))-2.\]

Recommendations

Cites work

Cited in

(32)

Describes a project that uses

Uses Software

This page was built for publication: Upper bounds for the regularity of powers of edge ideals of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998945)