Quasi-graphic matroids
Combinatorics
2017-04-25 v2
Abstract
Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, {\em quasi-graphic matroids}, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids, it is easy to certify that a matroid is quasi-graphic. The main result of the paper is that every -connected representable quasi-graphic matroid is either a lifted-graphic matroid or a frame matroid.
Keywords
Cite
@article{arxiv.1512.03005,
title = {Quasi-graphic matroids},
author = {Jim Geelen and Bert Gerards and Geoff Whittle},
journal= {arXiv preprint arXiv:1512.03005},
year = {2017}
}
Comments
This version corrects a serious error in arXiv:1512.03005v1