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