Binomial edge ideals with pure resolutions (Q486346): Difference between revisions

Let \(G = (V,E)\) be an undirected graph on the vertex set \(V = \{1,\ldots,n\}\) and let \(S = K[x_1,\ldots,x_n,y_1,\ldots,y_n]\) be a polynomial ring in \(2n\) variables over a field \(K\). The binomial edge ideal of \(G\), denoted by \(J_G\) is the ideal generated by the degree \(2\) binomials \(x_i y_j - x_j y_i\), where \(\{i,j\} \in E\). This paper provides several interesting results concerning minimal graded free resolutions of binomial edge ideals. Firstly, they prove that for a graph \(G\) without isolated vertices, its corresponding binomial edge ideal \(J_G\) has a pure resolution if and only if \(G\) is a complete graph, a complete bipartite graph, or the disjoint union of some paths. This result generalizes another one by the authors [Electron. J. Comb. 19, No. 2, Research Paper P44, 6 p. (2012; Zbl 1262.13012)], where they proved that \(J_G\) has a linear resolution if and only if \(G\) is a complete graph. Moreover, they also introduce an operation on graphs that produces graphs with essentially the same minimal graded free resolution, i.e., with the same Betti numbers \(\beta_{i,j}(J_G)\), projective dimension and (Castelnuovo-Mumford) regularity. Exploiting this operation, the authors are able to compute all the Betti numbers, the projective dimension and the regularity of the edge binomial ideals of a family of graphs, the so called \(k\)-handle lollipop graphs. Finally, the authors study the linear strand of the binomial edge ideals, this is, the Betti numbers \(\beta_{i,i+2}(J_G)\). They conjecture that \(\beta_{i,i+2} = (i+1)k_{i+2}(G)\), where \(k_i(G)\) denotes the number of cliques of \(G\) which are isomorphic to the complete graph with \(i\) vertices. This conjecture is proved for some families of graphs. The authors also support this conjecture with some partial results and computational evidences with the software CoCoA.