English

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

Commutative Algebra 2019-07-08 v1 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1907.02743,
  title  = {Regularity of symbolic powers of edge ideals of Cameron-Walker graphs},
  author = {S. A. Seyed Fakhari},
  journal= {arXiv preprint arXiv:1907.02743},
  year   = {2019}
}