pith. sign in

arxiv: 1604.00654 · v1 · pith:IDXC5KUWnew · submitted 2016-04-03 · 🧮 math.AC · math.CO

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

classification 🧮 math.AC math.CO
keywords graphcoverideallinearpowerssymbolicverywell-covered
0
0 comments X
read the original abstract

Let $G$ be a graph with $n$ vertices and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that if $G$ is a very well-covered graph such that $J(G)$ has linear resolution, then $J(G)^{(k)}$ has linear resolution, for every integer $k\geq 1$. We also prove that for a every very well-covered graph $G$, the depth of symbolic powers of $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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.