Regularity of symbolic powers of edge ideals of Cameron-Walker graphs

Abstract

A Cameron-Walker graph is a graph for which the matching number and the induced matching number are the same. Assume that G is a Cameron-Walker graph with edge ideal I(G), and let ∈d-match(G) be the induced matching number of G. It is shown that for every integer s≥ 1, we have the equality reg(I(G)(s))=2s+∈d-match(G)-1, where I(G)(s) denotes the s-th symbolic power of I(G).

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…