Resolution of unmixed bipartite graphs
From MaRDI portal
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.
Recommendations
- Regularity, depth and arithmetic rank of bipartite edge ideals
- The projective dimension of the edge ideal of a very well-covered graph
- On minimal free resolution of edge ideals of multipartite crown graphs
- On generalized graph ideals of complete bipartite graphs
- Freiman cover ideals of unmixed bipartite graphs
Cited in
(17)- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- Extremal Betti numbers of edge ideals
- Freiman cover ideals of unmixed bipartite graphs
- A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
- On the Hilbert series of vertex cover algebras of unmixed bipartite graphs
- The projective dimension of the edge ideal of a very well-covered graph
- Splittings of monomial ideals
- scientific article; zbMATH DE number 5348111 (Why is no real title available?)
- On the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
- On generalized graph ideals of complete bipartite graphs
- Cover product and Betti polynomial of graphs
- Regularity and projective dimension of the edge ideal of C₅-free vertex decomposable graphs
- On the linear strand of edge ideals of some zero-divisor graphs
- Linear strand of edge ideals of zero divisor graphs of the ring ℤ n
- Homological invariants of edge ideals of Wollastonite graphs
- Unmixed bipartite graphs and sublattices of the Boolean lattices
- Regularity, depth and arithmetic rank of bipartite edge ideals
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)