# Gorenstein graphic matroids from multigraphs

Source: [Gorenstein graphic matroids from multigraphs](<https://www.sota2.com/research/paper/68fa57141e209131ce9a224f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:31:44.072Z

Authors: Max K\\"olbl

Published: 2019-12-09T05:52:56.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1912.03862>)

[PDF](<https://arxiv.org/pdf/1912.03862.pdf>)
