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

minorRamsey theorybinary matroidcycle matroidRamsey functionunavoidable minorsvector matroid

Mathematics Subject Classification ID

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

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

(27)

• The grid theorem for vertex-minors
• The structure of the 3-separations of 3-connected matroids
• Unavoidable vertex-minors in large prime graphs
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• A note on binary matroid with no \(M(K_{3,3})\)-minor
• Connected hyperplanes in binary matroids
• Unavoidable minors of large 3-connected matroids
• Capturing matroid elements in unavoidable 3-connected minors
• Unavoidable minors of large 4-connected bicircular matroids
• On extremal connectivity properties of unavoidable matroids
• Excluding a large theta graph
• Unavoidable doubly connected large graphs
• Matroids with many common bases.
• Unavoidable parallel minors of regular matroids
• Scattered classes of graphs
• Capturing two elements in unavoidable minors of 3-connected binary matroids
• Graphs of bounded depth‐2 rank‐brittleness
• Unavoidable connected matroids retaining a specified minor
• Maximum size binary matroids with no \(AG(3,2)\)-minor are graphic
• On the unique representability of spikes over prime fields
• Inequivalent representations of matroids over prime fields
• Unavoidable minors for graphs with large \(\ell_p\)-dimension
• On 3-connected minors of 3-connected matroids and graphs
• Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs
• Minimally 3-connected binary matroids
• On minor-minimally 3-connected binary matroids
• Unavoidable minors for connected 2-polymatroids

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)