|国家预印本平台
首页|Binomial edge ideals and bounds for their regularity

Binomial edge ideals and bounds for their regularity

Binomial edge ideals and bounds for their regularity

来源:Arxiv_logoArxiv
英文摘要

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1,\ldots, y_n].$ We prove that the Castelnuovo-Mumford regularity of $J_G$ is bounded above by $c(G)+1$ when $G$ is a quasi-block graph or semi-block graph. We give another proof of Saeedi Madani-Kiani regularity upper bound conjecture for chordal graphs. We obtain the regularity of binomial edge ideals of Jahangir graphs. Later, we establish a sufficient condition for Hibi-Matsuda conjecture to be true.

Arvind Kumar

10.1007/s10801-020-00939-2

数学

Arvind Kumar.Binomial edge ideals and bounds for their regularity[EB/OL].(2020-06-11)[2025-07-16].https://arxiv.org/abs/2006.07188.点此复制

评论