Bounding Betti numbers of bipartite graph ideals

2008/07/09 by Michael Goff, Goff, Michael
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.0807.1540

openalex publication_date 2008/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Citations

• Restricting linear syzygies: algebra and geometry

Related

• Extremal Betti numbers of some classes of binomial edge ideals
• Certain Homological Invariants of Bipartite Kneser Graphs
• On the Betti numbers of some classes of Binomial edge ideals
• Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs
• Regularity 3 in edge ideals associated to bipartite graphs