✦ LIBER ✦

Finite connectivity in infinite matroids

✍ Scribed by Henning Bruhn; Paul Wollan

Book ID: 118737083
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 260 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposing infinite matroids into their

Decomposing infinite matroids into their 3-connected minors

✍ Elad Aigner-Horev; Reinhard Diestel; Luke Postle 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Infinite matroids in graphs

✍ Henning Bruhn; Reinhard Diestel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Bases in Infinite Matroids

✍ Aharoni, R.; Pouzet, M. 📂 Article 📅 1991 🏛 Oxford University Press 🌐 English ⚖ 193 KB

Matroidal families of finite connected n

Matroidal families of finite connected nonhomeomorphic graphs exist

✍ Thomas Andreae 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A matroidal family is a nonempty set ℱ of connected finite graphs such that for every arbitrary finite graph __G__ the edge sets of the subgraphs of __G__ which are isomorphic to an element of ℱ form a matroid on the edge set of __G__. In the present paper the question whether there are

A matroid related to finitely chainlike,

✍ A. C. Tucker; A. H. Zemanian 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

Connected hyperplanes in binary matroids

✍ Manoel Lemos; T.R.B. Melo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 259 KB