Gorenstein Binomial Edge Ideals
Abstract
We classify connected graphs G whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.
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.