On the binomial edge ideals of block graphs
classification
🧮 math.AC
math.CO
keywords
binomialedgeblockidealsgraphsidealminimalregularity
read the original abstract
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
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.