Regularity bounds for binomial edge ideals

Kazunori Matsuda, Satoshi Murai

Research output: Contribution to journalArticle

24 Citations (Scopus)

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 languageEnglish
Pages (from-to)141-149
Number of pages9
JournalJournal of Commutative Algebra
Volume5
Issue number1
DOIs
Publication statusPublished - 2013 Aug 15
Externally publishedYes

Fingerprint

Edge Ideals
Regularity
Castelnuovo-Mumford Regularity
Path
Graph in graph theory

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 journalArticle

Matsuda, Kazunori ; Murai, Satoshi. / Regularity bounds for binomial edge ideals. In: Journal of Commutative Algebra. 2013 ; Vol. 5, No. 1. pp. 141-149.
@article{6dadd2acd473459287f62fa82c04aef5,
title = "Regularity bounds for binomial edge ideals",
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.",
author = "Kazunori Matsuda and Satoshi Murai",
year = "2013",
month = "8",
day = "15",
doi = "10.1216/JCA-2013-5-1-141",
language = "English",
volume = "5",
pages = "141--149",
journal = "Journal of Commutative Algebra",
issn = "1939-0807",
publisher = "Rocky Mountain Mathematics Consortium",
number = "1",

}

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 -