| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655152 | Journal of Combinatorial Theory, Series A | 2016 | 7 Pages |
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 reg(JG)≤n−1reg(JG)≤n−1 for any graph G with n vertices, which is not a path.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dariush Kiani, Sara Saeedi Madani,