An upper bound for the regularity of binomial edge ideals of trees
classification
🧮 math.AC
keywords
binomialboundedgeidealsregularitytreesupperarticle
read the original abstract
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
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.