The Castelnuovo-Mumford regularity of binomial edge ideals

preprint2015arXivOpen access

Abstract

We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that reg(JG)≤n−1\mathrm{reg}(J_G)\leq n-1 for any graph GG with nn vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.