Zum Inhalt springen
Decomposing infinite matroids into their 3-connected minors
-
Link:
-
-
Autor/in:
-
-
Erscheinungsjahr:
-
2011
-
Medientyp:
-
Text
-
Schlagworte:
-
-
Decomposition trees
-
Infinite matroids
-
Matroid connectivity
-
Beschreibung:
-
-
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. © 2011.
-
Lizenz:
-
-
info:eu-repo/semantics/closedAccess
-
Quellsystem:
-
Forschungsinformationssystem der UHH
Interne Metadaten
- Quelldatensatz
- oai:www.edit.fis.uni-hamburg.de:publications/1edcac8c-25d2-4453-80b7-fdff7178cd96