arXiv:2106.03414 [math.CO]AbstractReferencesReviewsResources
Intertwining connectivities for vertex-minors and pivot-minors
Published 2021-06-07Version 1
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 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.
Comments: 8 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2109.07656 [math.CO] (Published 2021-09-16)
The Q-index and connectivity of graphs
arXiv:2305.17143 [math.CO] (Published 2023-05-25)
The least eigenvalue of the complements of graphs with given connectivity
arXiv:0906.3946 [math.CO] (Published 2009-06-22)
The rainbow $k$-connectivity of two classes of graphs