List your company

Gorenstein graphic matroids from multigraphs

About

A matroid is Gorenstein if its toric variety is. Hibi, Laso\'n, Matsuda, Micha\l{}ek, and Vodi\v{c}ka provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to multigraphs.

Related benchmarks

No related benchmarks have been indexed for this paper yet.