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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.