Regularity bounds for binomial edge ideals

From MaRDI portal
Publication:350810

DOI10.1216/JCA-2013-5-1-141zbMATH Open1272.13018arXiv1208.2415MaRDI QIDQ350810FDOQ350810


Authors: Kazunori Matsuda, Satoshi Murai Edit this on Wikidata


Publication date: 3 July 2013

Published in: Journal of Commutative Algebra (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1208.2415




Recommendations





Cited In (52)

Uses Software





This page was built for publication: Regularity bounds for binomial edge ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350810)