Inductive tools for connected ribbon graphs, delta-matroids and multimatroids
arXiv:1702.07179 · doi:10.1016/j.ejc.2017.02.005
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.
17 Pages. New version takes into account referees' comments with improved exposition here and there, and some reordering of material in the main section
References in corpus (8)
- The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems
- Interlace Polynomials for Multimatroids and Delta-Matroids
- On the interplay between embedded graphs and delta-matroids
- Separability and the genus of a partial dual
- Matroids, Delta-matroids and Embedded Graphs
- Nullity and Loop Complementation for Delta-Matroids
- Partial duals of plane graphs, separability and the graphs of knots
- Quaternary Bicycle Matroids and the Penrose Polynomial for Delta-Matroids