A chain theorem for matroids
From MaRDI portal
Publication:2483472
The authors prove a chain theorem for a class of sequentially 4-connected matroids for which each 3-separation has at most five elements on one side.
Recommendations
- A chain theorem for 4-connected matroids
- Menger's theorem for matroids
- On chains of matroids in the weak order
- An Erdős-Gallai theorem for matroids
- scientific article; zbMATH DE number 1013842
- A Tverberg type theorem for matroids
- A chain theorem for internally 4-connected binary matroids
- A matroid related to finitely chainlike, countably infinite networks
- Chains, Demi-Matroids, and Profiles
- scientific article; zbMATH DE number 15368
Cites work
- A chain theorem for 4-connected matroids
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Generating weakly 4-connected matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3563154 (Why is no real title available?)
- Matroid 4-connectivity: A deletion-contraction theorem
- On inequivalent representations of matroids over non-prime fields
- On the structure of 3-connected matroids and graphs
- On the Uniqueness of Matroid Representations Over GF(4)
- The structure of the 3-separations of 3-connected matroids
- The structure of the 3-separations of 3-connected matroids. II.
- Wild triangles in 3-connected matroids
Cited in
(19)- On chains of 3-connected matroids
- Extensions of Tutte's wheels-and-whirls theorem
- Improving a chain theorem for triangle-free 3-connected matroids
- Matroid 4-connectivity: A deletion-contraction theorem
- Strengthened chain theorems for different versions of 4-connectivity
- A wheels-and-whirls theorem for 3-connected 2-polymatroids
- Towards a splitter theorem for internally 4-connected binary matroids. III
- Towards a splitter theorem for internally 4-connected binary matroids. IV
- Towards a splitter theorem for internally 4-connected binary matroids. V
- A Proof of Dilworth's Chain Decomposition Theorem
- An Erdős-Gallai theorem for matroids
- A Tverberg type theorem for matroids
- On chains of matroids in the weak order
- Partitions of points into simplices with k-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- Refining a chain theorem from matroids to internally 4-connected graphs
- A chain theorem for 4-connected matroids
- A chain theorem for internally 4-connected binary matroids
- Exposing 3-separations in 3-connected matroids
This page was built for publication: A chain theorem for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483472)
