✦ LIBER ✦

On matroids of the greatestW-connectivity

✍ Scribed by Li Weixuan

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 407 KB
Volume: 35
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90077-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On Extremal Connectivity Properties of U

On Extremal Connectivity Properties of Unavoidable Matroids

✍ Zhaoyang Wu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On 3-connected matroids

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

Theorems on matroid connectivity

✍ T. Inukai; L. Weinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 135 KB

On the connectivity function of a matroi

On the connectivity function of a matroid

✍ P.D Seymour 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Matroids having the same connectivity fu

Matroids having the same connectivity function

✍ Manoel Lemos 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 532 KB

We define the connectivity function of a matroid M on a set ## E as c(M; X)=r(X)+r(E\X)-r(E)+ 1(X c E), where r is the rank function of M. Cunningham conjectured that a connected matroid is determined, up to duality, by its connectivity function. proved this for binary matroids and we shall prov