The transition matroid of a 4-regular graph: an introduction
Combinatorics
2015-07-01 v7
Abstract
Given a 4-regular graph , we introduce a binary matroid on the set of transitions of . Parametrized versions of the Tutte polynomial of yield several well-known graph and knot polynomials, including the Martin polynomial, the homflypt polynomial, the Kauffman polynomial and the Bollob\'as-Riordan polynomial.
Cite
@article{arxiv.1307.8097,
title = {The transition matroid of a 4-regular graph: an introduction},
author = {Lorenzo Traldi},
journal= {arXiv preprint arXiv:1307.8097},
year = {2015}
}
Comments
v1: 29 pages, 9 figures. v2: minor corrections. v3: 30 pages, 9 figures. v4: 31 pages, 11 figures. v5: 34 pages, 11 figures v6: 42 pages, 19 figures . The definition of balanced mutation is corrected, and the discussion of touch-graphs is expanded. v7: 43 pages, 19 figures. Further changes may be made before publication in the European Journal of Combinatorics