RESOLUTION OF UNMIXED BIPARTITE GRAPHS

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

Somayeh Moradi, Fatemeh Mohammadi

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

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 (9)

• 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
• Title not available (Why is that?)
• Extremal Betti numbers of edge ideals
• Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
• 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 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)