Table of Contents
Fetching ...

The excluded 3-minors for vf-safe delta-matroids

Joseph E Bonin, Carolyn Chun, Steven D Noble

Abstract

Vf-safe delta-matroids have the desirable property of behaving well under certain duality operations. Several important classes of delta-matroids are known to be vf-safe, including the class of ribbon-graphic delta-matroids, which is related to the class of ribbon graphs or embedded graphs in the same way that graphic matroids correspond to graphs. In this paper, we characterize vf-safe delta-matroids and ribbon-graphic delta-matroids by finding the minimal obstructions, called excluded 3-minors, to membership in the class. We find the unique (up to twisted duality) excluded $3$-minor within the class of set systems for the class of vf-safe delta-matroids. In the literature, binary delta-matroids appear in many different guises, with appropriate notions of minor operations equivalent to that of $3$-minors, perhaps most notably as graphs with vertex minors. We give a direct explanation of this equivalence and show that some well-known results may be expressed in terms of $3$-minors.

The excluded 3-minors for vf-safe delta-matroids

Abstract

Vf-safe delta-matroids have the desirable property of behaving well under certain duality operations. Several important classes of delta-matroids are known to be vf-safe, including the class of ribbon-graphic delta-matroids, which is related to the class of ribbon graphs or embedded graphs in the same way that graphic matroids correspond to graphs. In this paper, we characterize vf-safe delta-matroids and ribbon-graphic delta-matroids by finding the minimal obstructions, called excluded 3-minors, to membership in the class. We find the unique (up to twisted duality) excluded -minor within the class of set systems for the class of vf-safe delta-matroids. In the literature, binary delta-matroids appear in many different guises, with appropriate notions of minor operations equivalent to that of -minors, perhaps most notably as graphs with vertex minors. We give a direct explanation of this equivalence and show that some well-known results may be expressed in terms of -minors.

Paper Structure

This paper contains 6 sections, 22 theorems, 19 equations, 1 figure, 7 tables.

Key Result

Lemma 2.1

For any minor $S'$ of a proper set system $S=(E,\mathcal{F})$, there are disjoint subsets $X$ and $Y$ of $E$ such that

Figures (1)

  • Figure 1: A complete set of circle graph obstructions.

Theorems & Definitions (36)

  • Lemma 2.1
  • Definition 2.2
  • Lemma 2.3
  • proof
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • proof
  • Lemma 3.3
  • proof
  • ...and 26 more