Resolution of unmixed bipartite graphs

DOI10.4134/BKMS.2015.52.3.977zbMATH Open1317.13034arXiv0901.3015MaRDI QIDQ5265568FDOQ5265568

Authors: Fatemeh Mohammadi, Somayeh Moradi 

Publication date: 28 July 2015

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0901.3015

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

zbMATH Keywords

edge idealminimal free resolutionunmixed bipartite graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Syzygies, resolutions, complexes and commutative rings (13D02)

Cited In (13)

• On the Hilbert series of vertex cover algebras 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
• THE PROJECTIVE DIMENSION OF THE EDGE IDEAL OF A VERY WELL-COVERED GRAPH
• On the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
• Title not available (Why is that?)
• Extremal Betti numbers of edge ideals
• Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
• Unmixed bipartite graphs and sublattices of the Boolean lattices
• Linear strand of edge ideals of zero divisor graphs of the ring ℤ _n
• On the linear strand of edge ideals of some zero-divisor graphs
• Splittings of monomial ideals
• Regularity, depth and arithmetic rank of bipartite edge ideals
• Regularity and projective dimension of the edge ideal of $C_5$-free vertex decomposable graphs

Uses Software

• Macaulay2

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)