Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"unavoidable minor"”.
-
Capturing elements in matroid minors
… reveals that a large 3-connected matroid M has unavoidable structure. For every n exceeding two, there is an integer f(n) so that if |E(M)| exceeds f(n), then M has a minor isomorphic to the rank-n wheel or whirl, a rank-n spike, the cycle or bond matroid of K_{3,n}, or U_{2,n} or U_{n-2,n}. In …
-
Unavoidable minors in graphs and matroids
… we ensure the presence of more highly structured minors. In particular, for all positive integers k, every 2-connected graph G has a series minor isomorphic to a k-edge cycle or K_{2,k}. In 1993, Oxley, Oporowski, and Thomas extended this result to 3- and internally 4-connected graphs identifying …