paper

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

arXiv:1907.02743

Abstract

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

Cited by in corpus (1)