Unavoidable minors of large 3-connected matroids
An earlier result of the same authors for 3-connected matroids is extended to the more general class of all 3-connected matroids. It is shown that for every integer \(n>2\) there exists a number \(N(n)\) such that every 3-connected matroid with at least \(N(n)\) elements has a minor isomorphic to an \((n+2)\)-point line or its dual, the cycle or cocycle matroid of \(K_{3,n}\), the cycle matroid of a wheel with \(n\) spokes, a whirl of rank \(n\), or a (uniform) \(n\)-spike. Introducing the idea of a hamiltonian partial representation of matroids which have a spanning circuit and using the fact that, up to duality, every sufficiently large 3-connected matroid has a big 3-connected hamiltonian minor, the proof of this theorem can be built on the earlier results for 3-connected binary matroids based on their matrix representations and some Ramsey-theoretic results for matrices. Furthermore it is shown that the above-mentioned result is best possible in the sense that the given list of matroids contains no redundancy.
- Connectivity in Matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- Ramsey numbers for matroids
- Typical subgraphs of 3- and 4-connected graphs
- Unavoidable minors of large 3-connected binary matroids
- Weak maps and stabilizers of classes of matroids
- On extremal connectivity properties of unavoidable matroids
- Matroids with many common bases.
- Biased graphs IV: Geometrical realizations
- Unavoidable doubly connected large graphs
- Unavoidable minors of large 3-connected binary matroids
- Capturing two elements in unavoidable minors of 3-connected binary matroids
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- Unavoidable parallel minors of regular matroids
- Unavoidable minors of large 4-connected bicircular matroids
- Binary matroids with no 4-spike minors
- On the unique representability of spikes over prime fields
- Unavoidable connected matroids retaining a specified minor
- Inequivalent representations of matroids over prime fields
- scientific article; zbMATH DE number 1303530 (Why is no real title available?)
- Capturing matroid elements in unavoidable 3-connected minors
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- Weighted exchange distance of basis pairs
- Clonal cores and flexipaths in matroids
- What is a 4-connected matroid?
- The structure of the 3-separations of 3-connected matroids
- Unavoidable vertex-minors in large prime graphs
This page was built for publication: Unavoidable minors of large 3-connected matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386436)
