The Castelnuovo-Mumford regularity of binomial edge ideals
classification
🧮 math.AC
math.CO
keywords
binomialedgeidealsregularitycastelnuovo-mumfordgraphsprovebehavior
read the original abstract
We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\mathrm{reg}(J_G)\leq n-1$ for any graph $G$ with $n$ vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.