Regularity bounds for binomial edge ideals
Commutative Algebra
2012-08-14 v1
Abstract
We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
Cite
@article{arxiv.1208.2415,
title = {Regularity bounds for binomial edge ideals},
author = {Kazunori Matsuda and Satoshi Murai},
journal= {arXiv preprint arXiv:1208.2415},
year = {2012}
}
Comments
6 pages