Bounding Betti numbers of bipartite graph ideals
classification
🧮 math.AC
keywords
bettibipartiteidealsnumbersboundboundingconjecturededge
read the original abstract
We prove a conjectured lower bound of Nagel and Reiner on Betti numbers of edge ideals of bipartite graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.