Depth and Extremal Betti Number of Binomial Edge Ideals

Abstract

Let G be a simple graph on the vertex set [n] and JG be the corresponding binomial edge ideal. Let G=v*H be the cone of v on H. In this article, we compute all the Betti numbers of JG in terms of Betti number of JH and as a consequence, we get the Betti diagram of wheel graph. Also, we study Cohen-Macaulay defect of S/JG in terms of Cohen-Macaulay defect of SH/JH and using this we construct a graph with Cohen-Macaulay defect q for any q≥ 1. We obtain the depth of binomial edge ideal of join of graphs. Also, we prove that for any pair (r,b) of positive integers with 1≤ b< r, there exists a connected graph G such that reg(S/JG)=r and the number of extremal Betti number of S/JG is b.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…