paper

Regularity and projective dimension of edge ideal of -free vertex decomposable graphs

arXiv:1305.6122

Abstract

In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a -free vertex decomposable graph , $\T{reg}(R/I(G))= c_G$, where is the maximum number of 3-disjoint edges in . Moreover for this class of graphs we characterize $\T{pd}(R/I(G))$ and $\T{depth}(R/I(G))$. As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs.

To appear in: Proc. Amer. Math. Soc

References in corpus (4)