Tangles, tree-decompositions and grids in matroids

DOI10.1016/j.jctb.2007.10.008zbMath1229.05070OpenAlexW2120958076MaRDI QIDQ1026005

Bert Gerards, Jim Geelen, Geoffrey P. Whittle

Publication date: 23 June 2009

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

zbMATH Keywords

matroidstanglestree-decompositiongraph minorsbranch-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

A note on multiflows and treewidth ⋮ Some recent progress and applications in graph minor theory ⋮ Inequivalent representations of matroids over prime fields ⋮ Decomposition width of matroids ⋮ Connectivity gaps among matroids with the same enumerative invariants ⋮ Tangles and Hierarchical Clustering ⋮ Some open problems on excluding a uniform matroid ⋮ Unnamed Item ⋮ Connectivity functions and polymatroids ⋮ Computing with Tangles ⋮ A short proof that every finite graph has a tree-decomposition displaying its tangles ⋮ Tangles, trees, and flowers ⋮ A characterization of tangle matroids

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Quickly excluding a planar graph
• On the excluded minors for the matroids of branch-width \(k\)
• Graph minors. XVI: Excluding a non-planar graph
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Obstructions to branch-decomposition of matroids
• Menger's theorem for matroids
• Unnamed Item
• Unnamed Item