Stability of Depths of Powers of Edge Ideals
Commutative Algebra
2016-01-13 v1 Combinatorics
Abstract
Let be a graph and let be its edge ideal. In this paper, we provide an upper bound of from which 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.
Cite
@article{arxiv.1601.02766,
title = {Stability of Depths of Powers of Edge Ideals},
author = {Tran Nam Trung},
journal= {arXiv preprint arXiv:1601.02766},
year = {2016}
}
Comments
To appear in Journal of Algebra