Cubic graphs, $S$-minors and conformal minors
Provides a theoretical bridge between S-minor and conformal minor characterizations in matching theory, enabling easier derivation of conformal minor lists for classes of matching covered graphs.
The paper extends a known result from graph minor theory to matching theory, proving that any class of matching covered graphs characterized by finitely many forbidden cubic S-minors also admits a characterization by finitely many forbidden cubic conformal minors, with the list derivable from the S-minor list. Applications include deducing known forbidden conformal minor characterizations for pfaffian near-bipartite and solid graphs.
It is well-known that any class of simple graphs, that is characterized by finitely many forbidden minors, also admits a characterization by finitely many forbidden topological minors; furthermore, the list of forbidden topological minors may be derived from the list of forbidden minors. We prove a similar result in Matching Theory. Our Main Theorem states that any class of matching covered graphs, that is characterized by finitely many forbidden $S$-minors that are cubic, also admits a characterization by finitely many forbidden conformal minors that are cubic as well; once again, the list of forbidden conformal minors may be derived from the list of forbidden $S$-minors. In order to establish the above, we first prove that every matching covered graph has one of two graphs as a conformal minor -- either $K_4$, or the $Θ$ graph (that is, two vertices joined by three edges). (In fact, we need and prove a much stronger statement.) This is reminiscent of a theorem due to Lovász: every nonbipartite matching covered graph has one of two graphs as a conformal minor -- either $K_4$, or the triangular prism $\overline{C_6}$. As applications of our Main Theorem, we deduce known 'forbidden conformal minor characterizations' of pfaffian near-bipartite graphs, and of pfaffian solid graphs, using their respective known 'forbidden $S$-minor characterizations'.