Intertwining connectivity in matroids
classification
🧮 math.CO
keywords
orderseparatesseparationsmallestbackslashconnectivitiesconnectivityelement
read the original abstract
Let $M$ be a matroid and let $Q$, $R$, $S$ and $T$ be subsets of the ground set such that the smallest separation that separates $Q$ from $R$ has order $k$ and the smallest separation that separates $S$ from $T$ has order $l$. We prove that if $E(M)-(Q\cup R\cup S\cup T)$ is sufficiently large, then there is an element $e$ of $M$ such that, in one of $M\backslash e$ or $M/e$, both connectivities are preserved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.