Minimal Cellular Resolutions of Powers of Graphs
Abstract
Let $G$ be a connected graph and let $I(G)$ denote its edge ideal. We classify when $I(G)^n$, for $n \ge 1$, admits a minimal Lyubeznik resolution. We also give a characterization for when $I(G)^n$ is bridge-friendly, which, in turn, implies that $I(G)^n$ has a minimal Barile-Macchia cellular resolution.
Published
2026-02-13
How to Cite
Chau, T., Ha, H. T., & Maithani, A. (2026). Minimal Cellular Resolutions of Powers of Graphs. The Electronic Journal of Combinatorics, 33(1), P1.25. https://doi.org/10.37236/13606
Article Number
P1.25