Resolution of Unmixed Bipartite Graphs

Simple item page
dc.creatorMohammadi, Fatemeh
dc.creatorMoradi, Somayeh
dc.date2009-01-20
dc.date.accessioned2026-07-07T12:32:08Z
dc.date.available2026-07-07T12:32:08Z
dc.descriptionFor 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.
dc.description8 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0901.3015
dc.identifierhttp://arxiv.org/abs/0901.3015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216683
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13D02, 13P10, 13D40, 13A02
dc.titleResolution of Unmixed Bipartite Graphs
dc.typetext

Files

Collections

arXiv