Resolution of Unmixed Bipartite Graphs

Abstract

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

8 pages, 1 figure

References in corpus (2)

• Unmixed bipartite graphs
• Regularity, Depth and Arithmetic Rank of Bipartite Edge Ideals

Cited by in corpus (4)

• Sequentially Cohen-Macaulay bipartite graphs: vertex decomposability and regularity
• Splittings of monomial ideals
• Extremal Betti numbers of edge ideals
• Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs