Regularity and projective dimension of edge ideal of C5-free vertex decomposable graphs
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 C5-free vertex decomposable graph G, reg(R/I(G))= cG, where cG is the maximum number of 3-disjoint edges in G. Moreover for this class of graphs we characterize pd(R/I(G)) and depth(R/I(G)). As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.