What is a 4-connected matroid?
Combinatorics
2025-04-17 v3
Abstract
The {\em breadth} of a tangle in a matroid is the size of the largest spanning uniform submatroid of the tangle matroid of . A matroid is {\em weakly -connected} if it is 3-connected and whenever is a partition of with , then . We prove that if is a tangle of order and breadth in a matroid , then has a weakly 4-connected minor with a tangle of order , breadth and has the property that is the tangle in induced by . A set of elements of a matroid is -{\em connected} if for all . As a corollary of our theorems on tangles we prove that if contains an -element -connected set where , then has a weakly -connected minor that contains an -element -connected set.
Keywords
Cite
@article{arxiv.2310.08832,
title = {What is a 4-connected matroid?},
author = {Nick Brettell and Susan Jowett and James Oxley and Charles Semple and Geoff Whittle},
journal= {arXiv preprint arXiv:2310.08832},
year = {2025}
}
Comments
37 pages