Stability of Depths of Powers of Edge Ideals
Abstract
Let G be a graph and let I := I (G) be its edge ideal. In this paper, we provide an upper bound of n from which R/ I(G)n is stationary, and compute this limit explicitly. This bound is always achieved if G has no cycles of length 4 and every its connected component is either a tree or a unicyclic graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.