Extremal Betti numbers of some classes of binomial edge ideals
Abstract
Let G be a cycle or a complete bipartite graph. We show that the binomial edge ideal JG and its initial ideal with respect to the lexicographic order have the same extremal Betti number.
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.