arXiv · 2608.17751
Depth and Krull dimension of Binomial edge ideals
Abstract
Let $J_G$ denote the binomial edge ideal of a finite graph $G$ in the polynomial ring $S$. We determine all triples $(n,t,d)$ with $n\geq 3$ for which there exists a finite connected graph $G$ on $n$ vertices with ${\mathrm{depth}}(S/J_{G})=t$ and $\dim(S/J_G)=d$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Takayuki Hibi, Sara Saeedi Madani. 2026-08-18. Depth and Krull dimension of Binomial edge ideals. https://arxiv.org/abs/2608.17751
Cite the original work for its findings. Save a collection to share your selection of sources.