Regularity of symbolic powers of cover ideals of graphs
Commutative Algebra
2017-09-12 v1 Combinatorics
Abstract
Let be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that is the cover ideal and is its -th symbolic power. We prove thatWe also determine families of graphs for which the above inequalities are equality.
Keywords
Cite
@article{arxiv.1709.03077,
title = {Regularity of symbolic powers of cover ideals of graphs},
author = {S. A. Seyed Fakhari},
journal= {arXiv preprint arXiv:1709.03077},
year = {2017}
}