Gorenstein graphic matroids from multigraphs
arXiv:1912.03862 · doi:10.1007/s00026-020-00495-3
Abstract
A matroid is Gorenstein if its toric variety is. Hibi, Lasoń, Matsuda, Michałek, and Vodička provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to multigraphs.
arXiv comment9 pages