ABSTRACT
Let IG be the binomial edge ideal on the generic 2×n - Hankel matrix associated with a closed graph G on the vertex set [n]. We characterize the graphs G for which IG has maximal regularity and is Gorenstein.
PDF download + Online access
Issue Purchase
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.
Register now or learn more