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 is a Cameron-Walker graph with edge ideal , and let be the induced matching number of . It is shown that for every integer , we have the equality , where denotes the -th symbolic power of .
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}
}