Abstract
Let be a connected finite simple graph and let be the edge ideal of . The smallest number for which $\depth S/I_G^k$ stabilizes is denoted by $\dstab(I_G)$. We show that $\dstab(I_G)<\ell(I_G)$ where denotes the analytic spread of . For trees we give a stronger upper bound for $\dstab(I_G)$. We also show for any two integers there exists a tree for which $\dstab(I_G)=a$ and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.