✦ LIBER ✦

Triangles in 3-connected matroids

✍ Scribed by Talmage James Reid

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 992 KB
Volume: 90
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90149-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 3-connected matroids

✍ Manoel Lemos 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 997 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

Connected Hyperplanes in Binary Matroids

✍ Jennifer McNulty; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further prove that each element in such a matroid is contained in at least two connected hyperplanes. Our main result generalizes a matroid result of Kelmans, and independently,

Characterizing 3-connected planar graphs

Characterizing 3-connected planar graphs and graphic matroids

✍ Manoel Lemos; Talmage James Reid; Haidong Wu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract A well‐known result of Tutte states that a 3‐connected graph __G__ is planar if and only if every edge of __G__ is contained in exactly two induced non‐separating circuits. Bixby and Cunningham generalized Tutte's result to binary matroids. We generalize both of these results and give n

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 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