On the minimal free resolution of symbolic powers of cover ideals of graphs
arXiv:2010.08878
Abstract
For any graph , assume that is the cover ideal of . Let denote the th symbolic power of . We characterize all graphs with the property that has a linear resolution for some (equivalently, for all) integer . Moreover, it is shown that for any graph , the sequence is nondecreasing. Furthermore, we compute the largest degree of minimal generators of when is either an unmixed of a claw-free graph.