Stability of Depths of Powers of Edge Ideals

preprint2016arXivOpen access

Abstract

Let GG be a graph and let I:=I(G)I := I (G) be its edge ideal. In this paper, we provide an upper bound of nn from which $\depth R/ I(G)^n$ is stationary, and compute this limit explicitly. This bound is always achieved if GG has no cycles of length 44 and every its connected component is either a tree or a unicyclic graph.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.