The structure of 2-separations of infinite matroids

DOI10.1016/J.JCTB.2015.05.011zbMATH Open1327.05050arXiv1201.1135OpenAlexW1529872609MaRDI QIDQ895994FDOQ895994

Authors: Elad Aigner-Horev, Reinhard Diestel, Luke Postle 

Publication date: 11 December 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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 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.

Full work available at URL: https://arxiv.org/abs/1201.1135

Recommendations

• On the intersection of infinite matroids
• The Intersection of Two Infinite Matroids
• The structure of crossing separations in matroids
• A Cantor-Bernstein theorem for infinite matroids
• Infinite matroids in graphs
• scientific article; zbMATH DE number 5585143
• scientific article; zbMATH DE number 67321
• Matroid and Tutte-connectivity in infinite graphs
• Intersection of a partitional and a general infinite matroid
• On matroid separations of graphs

zbMATH Keywords

tree-decompositioninfinite matroid2-separation3-connected matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Graph theory
• Decomposition of regular matroids
• Title not available (Why is that?)
• Axioms for infinite matroids
• Infinite matroids in graphs
• Finite connectivity in infinite matroids
• A Combinatorial Decomposition Theory
• Infinite gammoids
• Matroids with an infinite circuit-cocircuit intersection
• Thin sums matroids and duality
• An excluded minors method for infinite matroids
• Matroid and Tutte-connectivity in infinite graphs
• Decomposing infinite 2-connected graphs into 3-connected components

Cited In (10)

• Axioms for infinite matroids
• Reconstruction of infinite matroids from their 3-connected minors
• The structure of the 3-separations of 3-connected matroids. II.
• Tree sets
• Linked tree-decompositions of represented infinite matroids
• The structure of crossing separations in matroids
• Title not available (Why is that?)
• Matroid and Tutte-connectivity in infinite graphs
• Profiles of separations: in graphs, matroids, and beyond
• On the intersection conjecture for infinite trees of matroids

This page was built for publication: The structure of 2-separations of infinite matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895994)