Gorenstein graphic matroids from multigraphs
Combinatorics
2020-07-02 v3 Commutative Algebra
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.
Keywords
Cite
@article{arxiv.1912.03862,
title = {Gorenstein graphic matroids from multigraphs},
author = {Max Kölbl},
journal= {arXiv preprint arXiv:1912.03862},
year = {2020}
}
Comments
9 pages