Bounding Betti numbers of bipartite graph ideals
From MaRDI portal
Publication:1008767
DOI10.1016/J.JPAA.2008.11.023zbMATH Open1173.05357arXiv0807.1540OpenAlexW2079836066MaRDI QIDQ1008767FDOQ1008767
Authors: Michael Goff
Publication date: 30 March 2009
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Abstract: We prove a conjectured lower bound of Nagel and Reiner on Betti numbers of edge ideals of bipartite graphs.
Full work available at URL: https://arxiv.org/abs/0807.1540
Cites Work
- Cohen-Macaulay graphs
- Combinatorics and commutative algebra.
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Splittable ideals and the resolutions of monomial ideals
- Resolutions of square-free monomial ideals via facet ideals: a survey
- Betti numbers of monomial ideals and shifted skew shapes
- Restricting linear syzygies: algebra and geometry
- Specializations of Ferrers ideals
- Monomial and toric ideals associated to Ferrers graphs
- Characteristic-independence of Betti numbers of graph ideals
Cited In (3)
This page was built for publication: Bounding Betti numbers of bipartite graph ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008767)