pith. sign in

arxiv: 1709.03077 · v1 · pith:BUZ2EOA3new · submitted 2017-09-10 · 🧮 math.AC · math.CO

Regularity of symbolic powers of cover ideals of graphs

classification 🧮 math.AC math.CO
keywords graphscoversymbolicaboveassumebelongsbipartiteclasses
0
0 comments X
read the original abstract

Let $G$ be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that $J(G)$ is the cover ideal $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that$$k{\rm deg}(J(G))\leq {\rm reg}(J(G)^{(k)})\leq (k-1){\rm deg}(J(G))+|V(G)|-1.$$We also determine families of graphs for which the above inequalities are equality.

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.