On the regularity of edge ideal of graphs
Seyed Amin Seyed Fakhari, Siamak Yassemi

TL;DR
This paper investigates the regularity of edge ideals of graphs, introducing new invariants and establishing bounds and equalities for specific classes of graphs, including Cohen–Macaulay and doubly Cohen–Macaulay graphs.
Contribution
It introduces the invariants $ ext{ind-match}_{ ext{H}}(G)$ and $ ext{min-match}_{ ext{H}}(G)$, and proves bounds and exact formulas for the regularity of edge ideals in various graph classes.
Findings
Bounds the regularity between $ ext{ind-match}_{ ext{H}}(G)$ and $ ext{min-match}_{ ext{H}}(G)$.
Shows equality of regularity and invariants for Cohen–Macaulay graphs with girth at least five.
Establishes conditions for equality in doubly Cohen–Macaulay graphs.
Abstract
Let be a graph with vertices, be the polynomial ring in variables over a field and denote the edge ideal of . For every collection of connected graphs with , we introduce the notions of and . It will be proved that the inequalities are true. Moreover, we show that if is a Cohen--Macaulay graph with girth at least five, then . Furthermore, we prove that if is a paw--free and doubly Cohen--Macaulay graph, then if and only if every connected component of is either a complete graph or a -cycle graph. Among other results, we show that for every…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Rings, Modules, and Algebras · Polynomial and algebraic computation
