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.

6 pages

References in corpus (1)

• Binomial edge ideals and conditional independence statements

Cited by in corpus (1)

• On the Betti numbers of some classes of Binomial edge ideals