Binomial edge ideals of graphs

MaRDI QIDQ456296zbMATH OpenFDO

Authors Dariush Kiani, Sara Saeedi

Publication date 24 October 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p44

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

binomial edge ideals Castelnuovo-Mumford regularity linear resolutions

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Structure, classification theorems for modules and ideals in commutative rings (13C05) Syzygies, resolutions, complexes in associative algebras (16E05)

Review text

Let \(G\) be a finite simple graph with vertex set \(V(G) = \{v_1, \dots, v_n\}\) and edge set \(E(G)\). Also, let \(S = \mathbb{K}[x_1, \dots, x_n, y_1, \dots, y_n]\) be the polynomial ring over a field \(\mathbb{K}\). The binomial edge ideal of \(G\) is an ideal of \(S\) which is generated by binomials of the form \(f_{ij} = x_iy_j-x_jy_i\), where \(i < j\) and \(\{v_i, v_j\}\) is an edge of \(G\).NEWLINENEWLINEIn the paper under review the authors characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, they show that complete graphs are the only graphs with this property. They 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, they give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of a closed graph. More explicit they prove that the regularity of the binomial edge ideal of a closed graph \(G\) is less than or equal to \(c(G) + 1\), where \(c(G)\) is the number of maximal cliques of \(G\).

Recommendations

Cited in

(56)

This page was built for publication: Binomial edge ideals of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456296)