Cohen-Macaulay edge ideal whose height is half of the number of vertices
Marilena Crupi, Giancarlo Rinaldo, Naoki Terai

TL;DR
This paper characterizes Cohen-Macaulay graphs where the edge ideal's height is exactly half the number of vertices, providing specific criteria for such graphs.
Contribution
It introduces Cohen-Macaulay criteria for graphs with edge ideals of height half the number of vertices, a novel class in algebraic graph theory.
Findings
Provides necessary and sufficient conditions for Cohen-Macaulayness in this class
Identifies structural properties of graphs with this edge ideal height
Advances understanding of algebraic properties linked to graph structure
Abstract
We consider a class of graphs such that the height of the edge ideal is half of the number of the vertices. We give Cohen-Macaulay criteria for such graphs.
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 · Mind wandering and attention
