Abstract

Let I=I(G) be the edge ideal of a simple graph G. We prove thatreg(I(s))=reg(Is) for s=2,3, where I(s) is the s-th symbolic power of I. As a consequence, we prove the following boundsregIs≤regI+2s−2, for s=2,3,regI(s)≤regI+2s−2, for s=2,3,4.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call