The Castelnuovo–Mumford regularity of binomial edge ideals

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 for any graph G with n vertices, which is not a path.

Saved in:
Bibliographic Details
Published in:Journal of combinatorial theory. Series A 2016-04, Vol.139, p.80-86
Main Authors: Kiani, Dariush, Saeedi Madani, Sara
Format: Article
Language:English
Subjects:
Binomial edge ideal
Castelnuovo–Mumford regularity
Simplicial vertex
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 for any graph G with n vertices, which is not a path.
ISSN:0097-3165
1096-0899
DOI:10.1016/j.jcta.2015.11.004