English

On the regularity of small symbolic powers of edge ideals of graphs

Commutative Algebra 2019-08-30 v2 Combinatorics

Abstract

Assume that GG is a graph with edge ideal I(G)I(G) and let I(G)(s)I(G)^{(s)} denote the ss-th symbolic power of I(G)I(G). It is proved that for every integer s1s\geq 1, reg(I(G)(s+1))max{reg(I(G))+2s,reg(I(G)(s+1)+I(G)s)}.{\rm reg}(I(G)^{(s+1)})\leq \max\bigg\{{\rm reg}(I(G))+2s, {\rm reg}\big(I(G)^{(s+1)}+I(G)^s\big)\bigg\}.As a consequence, we conclude that reg(I(G)(2))reg(I(G))+2{\rm reg}(I(G)^{(2)})\leq {\rm reg}(I(G))+2, and reg(I(G)(3))reg(I(G))+4{\rm reg}(I(G)^{(3)})\leq {\rm reg}(I(G))+4. Moreover, it is shown that if for some integer k1k\geq 1, the graph GG has no odd cycle of length at most 2k12k-1, then reg(I(G)(s))2s+reg(I(G))2{\rm reg}(I(G)^{(s)})\leq 2s+{\rm reg}(I(G))-2, for every integer sk+1s\leq k+1. Finally, it is proven that reg(I(G)(s))=2s{\rm reg}(I(G)^{(s)})=2s, for s{2,3,4}s\in \{2, 3, 4\}, provided that the complementary graph G\overline{G} is chordal.

Keywords

Cite

@article{arxiv.1908.10845,
  title  = {On the regularity of small symbolic powers of edge ideals of graphs},
  author = {S. A. Seyed Fakhari},
  journal= {arXiv preprint arXiv:1908.10845},
  year   = {2019}
}