2011/07/20 by Jim Geelen, Geelen, Jim, Stefan H. M. van Zwam +1
Computer Science · Mathematics · #05B35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #math.CO #msc:05B35
paper · pdf · doi:10.48550/arxiv.1107.3914
21 pages
openalex publication_date 2011/07/20 · arxiv created 2014/12/10 · arxiv updated 2014/12/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element subset X of E(M) such that one of M\X and M/X is 3-connected and contains N as a minor.