Binomial edge ideals of small depth
Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani

TL;DR
This paper studies the topological and algebraic properties of binomial edge ideals of graphs, focusing on the structure of their primary decompositions and characterizing graphs with a specific depth.
Contribution
It introduces a topological approach to analyze binomial edge ideals and characterizes graphs with depth exactly four in the polynomial ring.
Findings
The poset associated with the primary decomposition has contractible subposets.
Characterization of all graphs with depth exactly four.
Provides algebraic consequences from topological properties.
Abstract
Let be a graph on and be the binomial edge ideal of in the polynomial ring . In this paper we investigate some topological properties of a poset associated to the minimal primary decomposition of . We show that this poset admits some specific subposets which are contractible. This in turn, provides some interesting algebraic consequences. In particular, we characterize all graphs for which .
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.
