On the Regularity of squarefree part of symbolic powers of edge ideals

Abstract

Assume that G is a graph with edge ideal I(G). For every integer s≥ 1, we denote the squarefree part of the s-th symbolic power of I(G) by I(G)\s\. We determine an upper bound for the regularity of I(G)\s\ when G is a chordal graph. If G is a Cameron-Walker graphs, we compute reg(I(G)\s\ in terms of the induced matching number of G. Moreover, for any graph G, we provide sharp upper bounds for reg(I(G)\2\) and reg(I(G)\3\).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…