Resolution of Unmixed Bipartite Graphs

Abstract

For an unmixed bipartite graph G we consider the lattice of vertex covers LG and compute depth, projective dimension and extremal Betti-numbers of R/I(G) in terms of this lattice.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…