An upper bound for the regularity of powers of edge ideals

TL;DR

This paper establishes an upper bound on the regularity of powers of edge ideals derived from finite simple graphs, contributing to the understanding of algebraic properties linked to graph theory.

Contribution

It provides a new upper bound for the regularity of powers of edge ideals, advancing theoretical knowledge in combinatorial commutative algebra.

Findings

Derived an explicit upper bound for regularity of edge ideal powers

Enhanced understanding of algebraic invariants related to graph structures

Potential applications in algebraic combinatorics and computational algebra

Abstract

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.