Tangles, tree-decompositions and grids in matroids

DOI10.1016/J.JCTB.2007.10.008MaRDI QIDQ1026005zbMATH OpenOpenAlexFDO

Authors Jim Geelen, Bert Gerards, Geoff 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

branch-widthgraph minorsmatroidstanglestree-decomposition

Mathematics Subject Classification ID

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

Recommendations

• Tangles, trees, and flowers
• A short proof that every finite graph has a tree-decomposition displaying its tangles
• A characterization of tangle matroids
• Obstructions to branch-decomposition of matroids
• Graph minors. X: Obstructions to tree-decomposition

Cites work

• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XVI: Excluding a non-planar graph
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 952954 (Why is no real title available?)
• Menger's theorem for matroids
• Obstructions to branch-decomposition of matroids
• On the excluded minors for the matroids of branch-width \(k\)
• Quickly excluding a planar graph

Cited in

(24)

• Graph minors. X: Obstructions to tree-decomposition
• A characterization of tangle matroids
• Obstructions to branch-decomposition of matroids
• Tangle and Maximal Ideal
• Rooted grid minors
• Inequivalent representations of matroids over prime fields
• Decomposition width of matroids
• Tangles and single linkage hierarchical clustering
• Trees of tangles in infinite separation systems
• Tangles are Decided by Weighted Vertex Sets
• Computing with tangles
• Tangle bases: Revisited
• Connectivity gaps among matroids with the same enumerative invariants
• Tangles and Hierarchical Clustering
• Characterising 4-tangles through a connectivity property
• What is a 4-connected matroid?
• Untangling Gaussian mixtures
• Title not available (Why is no real title available?)
• Connectivity functions and polymatroids
• A short proof that every finite graph has a tree-decomposition displaying its tangles
• Tangles, trees, and flowers
• A note on multiflows and treewidth
• Some recent progress and applications in graph minor theory
• Some open problems on excluding a uniform matroid

This page was built for publication: Tangles, tree-decompositions and grids in matroids

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