Regularity bounds for binomial edge ideals

Kazunori Matsuda; Satoshi Murai

doi:10.1216/JCA-2013-5-1-141

Regularity bounds for binomial edge ideals

Kazunori Matsuda, Satoshi Murai

Research output: Contribution to journal › Article › peer-review

34 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 language	English
Pages (from-to)	141-149
Number of pages	9
Journal	Journal of Commutative Algebra
Volume	5
Issue number	1
DOIs	https://doi.org/10.1216/JCA-2013-5-1-141
Publication status	Published - 2013 Aug 15
Externally published	Yes

ASJC Scopus subject areas

Algebra and Number Theory

Access to Document

10.1216/JCA-2013-5-1-141

Fingerprint Dive into the research topics of 'Regularity bounds for binomial edge ideals'. Together they form a unique fingerprint.

Cite this

@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 = aug,

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 -