In an effort to strengthen the notion of 3-connectivity, the authors study weakened versions of 4-connectivity for matroids. In particular, the authors introduce fork-connectivity, a new type of 4-connectivity for matroids, to allow further progress in matroid representation theory. Conjecture 1.1 (The analogue of Kahn's conjecture). For every finite field \(\text{GF}(q)\), there is an integer \(\nu_q\) such that every vertically 4-connected \(\text{GF}(q)\)-representable matroid has at most \(\nu_q\) inequivalent representations over \(\text{GF}(q)\). The authors believe Conjecture 1.1 to hold for vertically 4-connected matroids and prove that Conjecture 1.1 holds for fork-connected matroids if and only if it holds for vertically 4-connected matroids. The authors prove that every fork-connected matroid can be reduced to a vertically 4-connected matroid by a sequence of segment-cosegment or cosegment-segment exchanges. Since no analogue of Seymour's splitter theorem holds for vertically 4-connected matroids, the authors consider sequentially 4-connected matroids which are closed under duality, contain vertically 4-connected matroids, and for which an analogue of the wheels and whirls theorem has been proven. Fork-connectivity is weaker than sequential 4-connectivity yet maintains many benefits of stronger 4-connectivity notions (e.g. Conjecture 1.1). The authors conjecture that an analogue of Seymour's splitter theorem holds for the class of fork-connected matroids. By taking direct sums and 2-sums of 3-connected forked matroids, the class of forked matroids is formed, which is closed under duality and minors. The authors show this class has finitely many excluded minors.
- A simple theorem on 3-connectivity
- Branch-width and Rota's conjecture
- Branch-width and well-quasi-ordering in matroids and graphs.
- Connectivity in Matroids
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3563154 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 952954 (Why is no real title available?)
- Inequivalent representations of matroids having no \(U_{3,6}\)-minor
- Matroid 4-connectivity: A deletion-contraction theorem
- Modular Constructions for Combinatorial Geometries
- On a matroid generalization of graph connectivity
- On inequivalent representations of matroids over finite fields
- On matroid connectivity
- On matroids of branch-width three.
- On the delta-wye reduction for planar graphs
- On the structure of 3-connected matroids and graphs
- On the Uniqueness of Matroid Representations Over GF(4)
- The excluded minors for GF(4)-representable matroids
- The structure of a 3-connected matroid with a 3-separating set of essential elements
- Whitney Connectivity of Matroids
- The stable forking conjecture and generic structures
- Fan-extensions in fragile matroids
- Recent work in matroid representation theory
- The structure of \(\{U_{2,5}, U_{3,5}\}\)-fragile matroids
- Outerplanar obstructions for matroid pathwidth
- Outerplanar obstructions for matroid pathwidth
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids
This page was built for publication: Fork-decompositions of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883405)