Intertwining connectivity in matroids
Combinatorics
2014-03-06 v1
Abstract
Let be a matroid and let , , and be subsets of the ground set such that the smallest separation that separates from has order and the smallest separation that separates from has order . We prove that if is sufficiently large, then there is an element of such that, in one of or , both connectivities are preserved.
Keywords
Cite
@article{arxiv.1403.0997,
title = {Intertwining connectivity in matroids},
author = {Rong Chen and Geoff Whittle},
journal= {arXiv preprint arXiv:1403.0997},
year = {2014}
}