On the index of depth stability of symbolic powers of cover ideals of graphs
Abstract
Let G be a graph with n vertices and let S=K[x1,…,xn] be the polynomial ring in n variables over a field K. Assume that I(G) and J(G) denote the edge ideal and the cover ideal of G, respectively. We provide a combinatorial upper bound for the index of depth stability of symbolic powers of J(G). 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 G with the property that the Castelnuovo--Mumford regularity of S/I(G) is equal to the induced matching number of G.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.