✦ LIBER ✦

On packing minors into connected matroids

✍ Scribed by Manoel Lemos; James Oxley

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 477 KB
Volume: 189
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00055-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On packing 3-connected restrictions into

On packing 3-connected restrictions into 3-connected matroids

✍ James Oxley 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 925 KB

Unavoidable Minors of Large 3-Connected

Unavoidable Minors of Large 3-Connected Matroids

✍ Guoli Ding; Bogdan Oporowski; James Oxley; Dirk Vertigan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 704 KB

This paper proves that, for every integer n exceeding two, there is a number N(n) such that every 3-connected matroid with at least N(n) elements has a minor that is isomorphic to one of the following matroids: an (n+2)-point line or its dual, the cycle or cocycle matroid of K 3, n , the cycle matro

Unavoidable Minors of Large 3-Connected

Unavoidable Minors of Large 3-Connected Binary Matroids

✍ Guoli Ding; Bogdan Oporowski; James Oxley; Dirk Vertigan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 759 KB

We show that, for every integer n greater than two, there is a number N such that every 3-connected binary matroid with at least N elements has a minor that is isomorphic to the cycle matroid of K 3, n , its dual, the cycle matroid of the wheel with n spokes, or the vector matroid of the binary matr

On 3-connected matroids

✍ Manoel Lemos 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 997 KB

On the Excluded Minors for Quaternary Ma

On the Excluded Minors for Quaternary Matroids

✍ J.F. Geelen; J.G. Oxley; D.L. Vertigan; G.P. Whittle 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 221 KB

This paper strengthens the excluded-minor characterization of GF(4)-representable matroids. In particular, it is shown that there are only finitely many 3-connected matroids that are not GF(4)-representable and that have no U 2, 6 -, U 4, 6 -, P 6 -, F & 7 -, or (F & 7 )\*-minors. Explicitly, these

On matroid connectivity

✍ James Oxley; Haidong Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 138 KB

If M is a loopless matroid in which MIX and MI Y are connected and X c~ Y is non-empty, then one easily shows that MI(X u Y) is connected. Likewise, it is straightforward to show that if G and H are n-connected graphs having at least n common vertices, then G u H is nconnected. The purpose of this n