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.
| Original language | English |
|---|---|
| Pages (from-to) | 141-149 |
| Number of pages | 9 |
| Journal | Journal of Commutative Algebra |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2013 Aug 15 |
| Externally published | Yes |
ASJC Scopus subject areas
- Algebra and Number Theory
Fingerprint Dive into the research topics of 'Regularity bounds for binomial edge ideals'. Together they form a unique fingerprint.
Cite this
Matsuda, K., & Murai, S. (2013). Regularity bounds for binomial edge ideals. Journal of Commutative Algebra, 5(1), 141-149. https://doi.org/10.1216/JCA-2013-5-1-141