Regularity bounds for binomial edge ideals
By Kazunori Matsuda, Satoshi Murai. 2012
90 citations recorded by the source corpus.
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.
Subfields: Algebra and Number Theory
View Paper: https://www.semanticscholar.org/paper/ebbc8adee250e1171b4ea822aa7e0d0efa4ea76d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
Citations in the corpus
- On the regularity of binomial edge ideals (2013, methodology): “In [8], Matsuda and Murai conjectured that if G is a connected graph on n vertices, then reg(S/JG) = n − 1 if and only if G is a line graph.”