To compute the local cohomology of powers of edge ideals one needs to know their saturations. The saturation of the second and third powers has been described in terms of the graph in Hien et al. (J. Algebra 439, 225–244, 2015) and Terai and Trung (J. Pure Appl. Algebra 218, 1117–1129, 2014). In this article, we give a combinatorial description of the generators of the saturation of the fourth power. As a consequence, we are able to give a complete classification of the associated primes of the fourth power of edge ideals in terms of the graph.
Edge ideal Power Associated prime Depth Dominating subgraph Odd cycle
Mathematics Subject Classification (2010)
13C05 13C15 13F55
This is a preview of subscription content, log in to check access.
The authors would like to thank Prof. Ngo Viet Trung for his guidance.
Chen, J., Morey, S., Sung, A.: The stable set of associated primes of the ideal of a graph. Rocky Mountain. J. Math. 32, 71–89 (2002)zbMATHMathSciNetGoogle Scholar
Eisenbud, D.: Commutative Algebra: with a View Toward Algebraic Geometry. Springer-Verlag, New York (1995)Google Scholar
Francisco, C., Ha, H.T., Van Tuyl, A.: A conjecture on critical graphs and connections to the persistence of associated primes. Discret. Math. 310, 2176–2182 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
Francisco, C., Ha, H.T., Van Tuyl, A.: Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals. J. Algebra 331, 224–242 (2011)zbMATHMathSciNetCrossRefGoogle Scholar