Resolution of unmixed bipartite graphs

From MaRDI portal
Publication:5265568




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





Describes a project that uses

Uses Software





This page was built for publication: Resolution of unmixed bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265568)