Krull dimension and regularity of binomial edge ideals of block graphs

2018/03/03 by Mascia, Carla, Rinaldo, Giancarlo · 1 citation
#05C69 #05E40 #13C13 #13D02 #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1803.01239

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.

Cited by

• (Generalized) binomial edge ideals and their regularity

Related

• Regularity of Binomial Edge Ideals of Certain Block Graphs
• On the binomial edge ideals of block graphs
• On the Betti numbers of some classes of Binomial edge ideals
• On The Generalized Binomial Edge Ideals of Generalized Block Graphs
• On the extremal Betti numbers of binomial edge ideals of block graphs