scientific article; zbMATH DE number 1303530

From MaRDI portal
Publication:4250152





The paper surveys recent results in an area concerned with finding, in big enough graphs or matroids, a given set of highly structured minors. A result worth mentioning, due to Ding, Oporowski, Oxley and Vertigan is the following theorem: For every integer \(n>2\), there is an integer \(N(n)\) such that every 3-connected matroid with at least \(N(n)\) elements has a minor isomorphic to one of \(M(W_n)\), \(W^n\), \(M(K_{3,n})\), \(M^*(K_{3,n})\), \(U_{2,n+2}\), \(U_{n,n+2}\) or a (uniform) \(n\)-spike. For the entire collection see [Zbl 0910.00036].











This page was built for publication:

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