arXiv · 1803.01239
Krull dimension and regularity of binomial edge ideals of block graphs
Abstract
We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present a linear time algorithm to compute the Castelnuovo-Mumford regularity and Krull dimension of binomial edge ideals of block graphs.
Explore related subjects
Keep this discovery
Carla Mascia, Giancarlo Rinaldo. 2018-03-03. Krull dimension and regularity of binomial edge ideals of block graphs. https://arxiv.org/abs/1803.01239
Cite the original work for its findings. Save a collection to share your selection of sources.