Symbolic powers of cover ideal of very well-covered and bipartite graphs

preprint2016arXivOpen access

Abstract

Let GG be a graph with nn vertices and S=K[x1,…,xn]S=\mathbb{K}[x_1,\dots,x_n] be the polynomial ring in nn variables over a field K\mathbb{K}. Assume that J(G)J(G) is the cover ideal of GG and J(G)(k)J(G)^{(k)} is its kk-th symbolic power. We prove that if GG is a very well-covered graph such that J(G)J(G) has linear resolution, then J(G)(k)J(G)^{(k)} has linear resolution, for every integer k≥1k\geq 1. We also prove that for a every very well-covered graph GG, the depth of symbolic powers of J(G)J(G) forms a non-increasing sequence. Finally, we determine a linear upper bound for the regularity of powers of cover ideal of bipartite graph.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.