No label defined (Q4250152)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1303530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303530 |
Statements
9 January 2000
0 references
uniform matroid
0 references
\(n\)-wheel
0 references
3-connected matroid
0 references
minor
0 references
\(n\)-spike
0 references
0.8722565174102783
0 references
0.8691278696060181
0 references
0.8642561435699463
0 references
0.8587349057197571
0 references
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].
0 references