Behaviors of pairs of dimensions and depths of edge ideals
Akihiro Higashitani, Akane Kanno, and Ryota Ueji

TL;DR
This paper investigates the relationship between dimensions and depths of edge ideals of graphs, providing classifications for connected graphs with small vertices and chordal graphs, enhancing understanding of their algebraic properties.
Contribution
It characterizes possible dimension-depth pairs of edge ideals for connected graphs, especially for small and chordal graphs, expanding algebraic graph theory knowledge.
Findings
Complete classification for small connected graphs
Characterization of pairs for connected chordal graphs
Insights into algebraic properties of edge ideals
Abstract
Edge ideals of finite simple graphs on vertices are the ideals of the polynomial ring in variables generated by the quadratic monomials associated with the edges of . In this paper, we consider the possible pairs of dimensions and depths of for connected graphs with a fixed number of vertices. We discuss such pairs in the case where dimension is relatively large. As a corollary, we completely determine the pairs for connected graphs with small number of vertices. We also study the possible pairs for connected chordal 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 · Algebraic Geometry and Number Theory · Polynomial and algebraic computation
