Name
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 ( J G ) ¿ n - 1 for any graph G with n vertices, which is not a path. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jcta.2015.11.004 | Journal of Combinatorial Theory Series A |
Keywords | Field | DocType |
Binomial edge ideal,Castelnuovo–Mumford regularity,Simplicial vertex | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Upper and lower bounds,Binomial,Castelnuovo–Mumford regularity,Mathematics | Journal |
Volume | Issue | ISSN |
139 | C | 0097-3165 |
Citations | PageRank | References |
1 | 0.43 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dariush Kiani | 1 | 26 | 5.86 |
| Sara Saeedi Madani | 2 | 6 | 2.13 |