Matroid 4-connectivity: A deletion-contraction theorem

DOI10.1006/JCTB.2001.2032MaRDI QIDQ1850554zbMATHOpenAlexFDO

Authors James F. Geelen, Geoff Whittle

Publication date 10 December 2002

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.2001.2032

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Exposing 3-separations in 3-connected matroids
• The structure of the 4-separations in 4-connected matroids
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Generating weakly 4-connected matroids
• A chain theorem for matroids

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 53949 (Why is no real title available?)
• A simple theorem on 3-connectivity
• Connectivity in Matroids
• Decomposition of regular matroids
• Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
• Generating internally four-connected graphs
• On inequivalent representations of matroids over finite fields
• On the Uniqueness of Matroid Representations Over GF(4)

Cited in

(24)

• Wild triangles in 3-connected matroids
• A chain theorem for matroids
• Generating weakly 4-connected matroids
• The structure of the 4-separations in 4-connected matroids
• On matroids of branch-width three.
• A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
• Intertwining connectivity in matroids
• Improving a chain theorem for triangle-free 3-connected matroids
• Stability, fragility, and Rota's conjecture
• The structure of the 3-separations of 3-connected matroids
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Intertwining connectivities in representable matroids
• Exposing 3-separations in 3-connected matroids
• A chain theorem for 4-connected matroids
• The structure of \(\{U_{2,5}, U_{3,5}\}\)-fragile matroids
• The structure of 3-connected matroids of path width three
• On contracting hyperplane elements from a 3-connected matroid
• A chain theorem for internally 4-connected binary matroids
• Generating an internally 4-connected binary matroid from another
• Recent work in matroid representation theory
• Generating internally four-connected graphs
• On minimally \(k\)-connected matroids
• Constructive characterizations of 3-connected matroids of path width three
• Fork-decompositions of matroids

This page was built for publication: Matroid 4-connectivity: A deletion-contraction theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850554)