English

Regularity of symbolic powers of cover ideals of graphs

Commutative Algebra 2017-09-12 v1 Combinatorics

Abstract

Let GG 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)J(G) is the cover ideal GG and J(G)(k)J(G)^{(k)} is its kk-th symbolic power. We prove thatkdeg(J(G))reg(J(G)(k))(k1)deg(J(G))+V(G)1.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.

Keywords

Cite

@article{arxiv.1709.03077,
  title  = {Regularity of symbolic powers of cover ideals of graphs},
  author = {S. A. Seyed Fakhari},
  journal= {arXiv preprint arXiv:1709.03077},
  year   = {2017}
}