Abstract
Generalizing a well-known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the vertices of T correspond to minors of M each of which is either a maximal 3-connected minor of M, a circuit or a cocircuit, and the edges of T correspond to certain 2-separations of M. In addition, we show that the decomposition of M determines the decomposition of its dual in a natural manner.
| Original language | English |
|---|---|
| Pages (from-to) | 11-16 |
| Number of pages | 6 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | 38 |
| DOIs | |
| State | Published - 1 Dec 2011 |
| Externally published | Yes |
Keywords
- Decomposition trees
- Infinite matroids
- Matroid connectivity
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Decomposing infinite matroids into their 3-connected minors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver