Obstructions to branch-decomposition of matroids

DOI10.1016/j.jctb.2005.11.001zbMath1094.05011OpenAlexW2008773627MaRDI QIDQ2496205

Bert Gerards, Jim Geelen, Neil Robertson, Geoffrey P. Whittle

Publication date: 12 July 2006

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

zbMATH Keywords

connectivitymatroidsbranch width

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Matroids Representable Over Fields With a Common Subfield, Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids, Matroid tree-width, Some recent progress and applications in graph minor theory, Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract), Connectivity gaps among matroids with the same enumerative invariants, Tangle and Maximal Ideal, Tangle-tree duality in abstract separation systems, Faster algorithms for vertex partitioning problems parameterized by clique-width, Obstructions for Bounded Branch-depth in Matroids, Tangles, trees, and flowers, Tangle and ultrafilter: game theoretical interpretation, Tangles, tree-decompositions and grids in matroids, Structural submodularity and tangles in abstract separation systems, Matroid 3-connectivity and branch width, A characterization of tangle matroids, Matroids denser than a clique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. V. Excluding a planar graph
• Graph minors. X: Obstructions to tree-decomposition
• On the excluded minors for the matroids of branch-width \(k\)
• Partitioning Matroids with Only Small Cocircuits
• Menger's theorem for matroids