Binary matroids and local complementation
Combinatorics
2014-11-11 v6
Abstract
We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its Tutte polynomial yields the interlace polynomials of G.
Cite
@article{arxiv.1301.4946,
title = {Binary matroids and local complementation},
author = {Lorenzo Traldi},
journal= {arXiv preprint arXiv:1301.4946},
year = {2014}
}
Comments
This article supersedes arXiv:1301.0293. v2: 26 pages, 2 figures. v3 - v5: 31 pages, 2 figures v6: Final prepublication version