Intertwining connectivity in matroids

DOI10.1137/140959626MaRDI QIDQ2935275zbMATH OpenOpenAlexFDO

Authors Rong Chen, Geoff Whittle

Publication date 22 December 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.0997

zbMATH Keywords

connectivityintertwining connectivitymatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

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)-(QcupRcupScupT)$ is sufficiently large, then there is an element $e$ of $M$ such that, in one of $$ or $M/e$, both connectivities are preserved.

Recommendations

• Intertwining connectivities in representable matroids
• A notion of minor-based matroid connectivity
• Matroid 4-connectivity: A deletion-contraction theorem
• On matroid separations of graphs
• Matroids having the same connectivity function

Cited in

(4)

• Intertwining vectors and the connection between critical vertex and SOS models
• A matroid extension result
• Intertwining connectivities in representable matroids
• Intertwining Connectivities for Vertex-Minors and Pivot-Minors

This page was built for publication: Intertwining connectivity in matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935275)