Unavoidable minors of large 3-connected binary matroids

DOI10.1006/jctb.1996.0026zbMath0856.05022OpenAlexW2121741654MaRDI QIDQ1924132

Bogdan Oporowski, Guoli Ding, Dirk Vertigan, James G. 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)

Related Items (17)

Unavoidable minors of large 3-connected matroids ⋮ Inequivalent representations of matroids over prime fields ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Unavoidable Induced Subgraphs of Large 2-Connected Graphs ⋮ Matroids with many common bases. ⋮ Capturing matroid elements in unavoidable 3-connected minors ⋮ Connected hyperplanes in binary matroids ⋮ The structure of the 3-separations of 3-connected matroids ⋮ Unavoidable parallel minors of regular matroids ⋮ On the unique representability of spikes over prime fields ⋮ Excluding a large theta graph ⋮ Scattered Classes of Graphs ⋮ Unavoidable vertex-minors in large prime graphs ⋮ Large Wk- or K3,t-Minors in 3-Connected Graphs ⋮ Unavoidable doubly connected large graphs ⋮ On extremal connectivity properties of unavoidable matroids ⋮ The grid theorem for vertex-minors

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