Gorenstein graphic matroids from multigraphs
Abstract
A matroid is Gorenstein if its toric variety is. Hibi, Laso\'n, Matsuda, Michaek, and Vodicka provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to multigraphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.