On the minimal free resolution of symbolic powers of cover ideals of graphs
Abstract
For any graph G, assume that J(G) is the cover ideal of G. Let J(G)(k) denote the kth symbolic power of J(G). We characterize all graphs G with the property that J(G)(k) has a linear resolution for some (equivalently, for all) integer k≥ 2. Moreover, it is shown that for any graph G, the sequence ( reg(J(G)(k)))k=1∞ is nondecreasing. Furthermore, we compute the largest degree of minimal generators of J(G)(k) when G is either an unmixed of a claw-free graph.
0
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.