Inductive tools for connected ribbon graphs, delta-matroids and multimatroids
Combinatorics
2017-03-09 v2
Abstract
We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.
Cite
@article{arxiv.1702.07179,
title = {Inductive tools for connected ribbon graphs, delta-matroids and multimatroids},
author = {Carolyn Chun and Deborah Chun and Steven D. Noble},
journal= {arXiv preprint arXiv:1702.07179},
year = {2017}
}
Comments
17 Pages. New version takes into account referees' comments with improved exposition here and there, and some reordering of material in the main section