We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of a closed graph.
@article{10_37236_2349,
author = {Dariush Kiani and Sara Saeedi},
title = {Binomial edge ideals of graphs},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {2},
doi = {10.37236/2349},
zbl = {1262.13012},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2349/}
}
TY - JOUR
AU - Dariush Kiani
AU - Sara Saeedi
TI - Binomial edge ideals of graphs
JO - The electronic journal of combinatorics
PY - 2012
VL - 19
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/2349/
DO - 10.37236/2349
ID - 10_37236_2349
ER -
%0 Journal Article
%A Dariush Kiani
%A Sara Saeedi
%T Binomial edge ideals of graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2349/
%R 10.37236/2349
%F 10_37236_2349
Dariush Kiani; Sara Saeedi. Binomial edge ideals of graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2349
