English

Intertwining connectivities for vertex-minors and pivot-minors

Combinatorics 2023-10-20 v3

Abstract

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

Keywords

Cite

@article{arxiv.2106.03414,
  title  = {Intertwining connectivities for vertex-minors and pivot-minors},
  author = {Duksang Lee and Sang-il Oum},
  journal= {arXiv preprint arXiv:2106.03414},
  year   = {2023}
}

Comments

10 pages

R2 v1 2026-06-24T02:54:02.630Z