Resolution of Unmixed Bipartite Graphs
Commutative Algebra
2009-01-21 v1 Combinatorics
Abstract
For an unmixed bipartite graph we consider the lattice of vertex covers and compute depth, projective dimension and extremal Betti-numbers of in terms of this lattice.
Cite
@article{arxiv.0901.3015,
title = {Resolution of Unmixed Bipartite Graphs},
author = {Fatemeh Mohammadi and Somayeh Moradi},
journal= {arXiv preprint arXiv:0901.3015},
year = {2009}
}
Comments
8 pages, 1 figure