Depth stability of edge ideals
Abstract
Let G be a connected finite simple graph and let IG be the edge ideal of G. The smallest number k for which S/IGk stabilizes is denoted by (IG). We show that (IG)<(IG) where (IG) denotes the analytic spread of I. For trees we give a stronger upper bound for (IG). We also show for any two integers 1≤ a<b there exists a tree for which (IG)=a and (IG)=b.
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.