Unavoidable minors of large 3-connected binary matroids

DOI10.1006/JCTB.1996.0026MaRDI QIDQ1924132zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Bogdan Oporowski, Dirk Vertigan, James Oxley

Publication date 25 November 1996

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

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

zbMATH Keywords

binary matroidcycle matroidminorRamsey functionRamsey theoryunavoidable minorsvector matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Ramsey theory (05D10)

Review text

We show that, for every integer \(n\) greater than two, there is a number \(N\) such that every 3-connected binary matroid with at least \(N\) elements has a minor that is isomorphic to the cycle matroid of \(K_{3,n}\), its dual, the cycle matroid of the wheel with \(n\) spokes, or the vector matroid of the binary matrix \((I_n |J_n - I_n)\), where \(J_n\) is the \(n \times n\) matrix of all ones.

Recommendations

• Unavoidable minors of large 3-connected matroids
• Capturing two elements in unavoidable minors of 3-connected binary matroids
• Capturing matroid elements in unavoidable 3-connected minors
• scientific article; zbMATH DE number 1303530
• Unavoidable connected matroids retaining a specified minor

Cited in

(32)

• On minor-minimally 3-connected binary matroids
• On extremal connectivity properties of unavoidable matroids
• Unavoidable minors of large 3-connected matroids
• Matroids with many common bases.
• Unavoidable doubly connected large graphs
• Capturing two elements in unavoidable minors of 3-connected binary matroids
• Unavoidable minors for graphs with large \(\ell_p\)-dimension
• The grid theorem for vertex-minors
• Unavoidable parallel minors of regular matroids
• Unavoidable minors for connected 2-polymatroids
• Unavoidable minors of large 4-connected bicircular matroids
• A note on binary matroid with no \(M(K_{3,3})\)-minor
• On the unique representability of spikes over prime fields
• Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs
• Unavoidable connected matroids retaining a specified minor
• Maximum size binary matroids with no AG(3,2)-minor are graphic
• 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
• Scattered classes of graphs
• Connected hyperplanes in binary matroids
• Graphs of bounded depth‐2 rank‐brittleness
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• On 3-connected minors of 3-connected matroids and graphs
• A polynomial Ramsey statement for bounded VC-dimension
• Problems on group-labeled matroid bases
• Twin-width. IV: Ordered graphs and matrices
• The structure of the 3-separations of 3-connected matroids
• Excluding a large theta graph
• \(\mathcal{H}\)-clique-width and a hereditary analogue of product structure
• Unavoidable vertex-minors in large prime graphs
• Minimally 3-connected binary matroids

This page was built for publication: Unavoidable minors of large 3-connected binary matroids

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