Symplectic Matroids, Circuits, and Signed Graphs
Combinatorics
2020-09-22 v4
Abstract
One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give a definition of symplectic matroids by collections of circuits. As an application, we construct a class of examples of symplectic matroids from graphs in terms of circuits.
Cite
@article{arxiv.1809.08483,
title = {Symplectic Matroids, Circuits, and Signed Graphs},
author = {Zhexiu Tu},
journal= {arXiv preprint arXiv:1809.08483},
year = {2020}
}