On the extremal Betti numbers of binomial edge ideals of block graphs
Juergen Herzog, Giancarlo Rinaldo
TL;DR
This paper investigates the extremal Betti numbers of binomial edge ideals in block graphs, providing explicit computations and classifications for cases with a unique extremal Betti number.
Contribution
It computes a key extremal Betti number for binomial edge ideals of block graphs and classifies all such graphs with exactly one extremal Betti number.
Findings
Computed a distinguished extremal Betti number for binomial edge ideals of block graphs.
Classified all block graphs with exactly one extremal Betti number.
Abstract
We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.