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 |
Fingerprint
ASJC Scopus subject areas
- Algebra and Number Theory
Cite this
Regularity bounds for binomial edge ideals. / Matsuda, Kazunori; Murai, Satoshi.
In: Journal of Commutative Algebra, Vol. 5, No. 1, 15.08.2013, p. 141-149.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Regularity bounds for binomial edge ideals
AU - Matsuda, Kazunori
AU - Murai, Satoshi
PY - 2013/8/15
Y1 - 2013/8/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84881324131&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881324131&partnerID=8YFLogxK
U2 - 10.1216/JCA-2013-5-1-141
DO - 10.1216/JCA-2013-5-1-141
M3 - Article
AN - SCOPUS:84881324131
VL - 5
SP - 141
EP - 149
JO - Journal of Commutative Algebra
JF - Journal of Commutative Algebra
SN - 1939-0807
IS - 1
ER -