Abstract
Let be a graph and let be its edge ideal. In this paper, we provide an upper bound of from which $\depth R/ I(G)^n$ is stationary, and compute this limit explicitly. This bound is always achieved if has no cycles of length and every its connected component is either a tree or a unicyclic graph.
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.