Mathematics – Combinatorics
Scientific paper
2012-01-05
Mathematics
Combinatorics
30 pages
Scientific paper
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
nodes of T correspond to minors of M that are either 3-connected or circuits or
cocircuits, and the edges of T correspond to certain nested 2-separations of M.
These decompositions are invariant under duality.
Aigner-Horev Elad
Diestel Reinhard
Postle Luke
No associations
LandOfFree
The structure of 2-separations of infinite matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The structure of 2-separations of infinite matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The structure of 2-separations of infinite matroids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-609648