LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Binomial edge ideals and bounds for their regularity

Photo from wikipedia

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… Click to show full 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.

Keywords: ideals bounds; edge; regularity binomial; binomial edge; edge ideals

Journal Title: Journal of Algebraic Combinatorics
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.