paper

On the index of depth stability of symbolic powers of cover ideals of graphs

arXiv:2308.10463

Abstract

Let be a graph with vertices and let be the polynomial ring in variables over a field . Assume that and denote the edge ideal and the cover ideal of , respectively. We provide a combinatorial upper bound for the index of depth stability of symbolic powers of . As a consequence, we compute the depth of symbolic powers of cover ideals of fully clique-whiskered graphs. Meanwhile, we determine a class of graphs with the property that the Castelnuovo--Mumford regularity of is equal to the induced matching number of .

arXiv admin note: substantial text overlap with arXiv:1709.03882