Bounding Betti numbers of bipartite graph ideals

DOI10.1016/J.JPAA.2008.11.023MaRDI QIDQ1008767zbMATH OpenOpenAlexFDO

Authors Michael Goff

Publication date 30 March 2009

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic combinatorics (05E99)

Abstract: We prove a conjectured lower bound of Nagel and Reiner on Betti numbers of edge ideals of bipartite graphs.

Cites work

• Betti numbers of monomial ideals and shifted skew shapes
• Characteristic-independence of Betti numbers of graph ideals
• Cohen-Macaulay graphs
• Combinatorics and commutative algebra.
• Monomial and toric ideals associated to Ferrers graphs
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• Resolutions of square-free monomial ideals via facet ideals: a survey
• Restricting linear syzygies: algebra and geometry
• Specializations of Ferrers ideals
• Splittable ideals and the resolutions of monomial ideals

Cited in

(3)

• Nonvanishing of Betti numbers of edge ideals and complete bipartite subgraphs
• Nonvanishing Betti numbers of edge ideals of weakly chordal graphs
• Betti numbers of edge ideals of some split graphs

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)