Intertwining connectivities for vertex-minors and pivot-minors

Abstract

We show that for pairs $(Q,R)$ and $(S,T)$ of disjoint subsets of vertices of a graph $G$, if $G$ is sufficiently large, then there exists a vertex $v$ in $V(G)-(Q\cup R\cup S\cup T)$ such that there are two ways to reduce $G$ by a vertex-minor operation that removes $v$ while preserving the connectivity between $Q$ and $R$ and the connectivity between $S$ and $T$. Our theorem implies an analogous theorem of Chen and Whittle (2014) for matroids restricted to binary matroids.

10 pages

References in corpus (2)

• The grid theorem for vertex-minors
• Rank connectivity and pivot-minors of graphs