paper

Regularity of symbolic powers of cover ideals of graphs

arXiv:1709.03077

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.