Symbolic powers of cover ideal of very well-covered and bipartite graphs
arXiv:1604.00654
Abstract
Let be a graph with vertices and be the polynomial ring in variables over a field . Assume that is the cover ideal of and is its -th symbolic power. We prove that if is a very well-covered graph such that has linear resolution, then has linear resolution, for every integer . We also prove that for a every very well-covered graph , the depth of symbolic powers of forms a non-increasing sequence. Finally, we determine a linear upper bound for the regularity of powers of cover ideal of bipartite graph.