Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimal cellular resolutions of powers of graphs

Published 5 Apr 2024 in math.AC | (2404.04380v2)

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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.