Papers
Topics
Authors
Recent
Search
2000 character limit reached

Binomial edge ideals and bounds for their regularity

Published 11 Jun 2020 in math.CO and math.AC | (2006.07188v2)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.