Linked tree-decompositions of represented infinite matroids

DOI10.1016/j.jctb.2010.12.003zbMath1298.05052OpenAlexW2135864228MaRDI QIDQ716055

Jeffrey Azzato

Publication date: 19 April 2011

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2010.12.003

zbMATH Keywords

tree decompositionwell-quasi-orderingtree-widthinfinite matroidsbranch-width

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Related Items (4)

A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ Linked tree-decompositions of represented infinite matroids ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms

Cites Work

• Linked tree-decompositions of represented infinite matroids
• Matroid tree-width
• Addendum to matroid tree-width
• The Menger-like property of the three-width of infinite graphs
• Cliques in dense GF(\(q\))-representable matroids
• Branch-width and well-quasi-ordering in matroids and graphs.
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Varieties of Combinatorial Geometries
• Infinite Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linked tree-decompositions of represented infinite matroids