An upper bound for the regularity of binomial edge ideals of trees
Abstract
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.