Obstructions for Bounded Branch-depth in Matroids

DOI10.19086/AIC.24227zbMath1477.05018arXiv2003.13975OpenAlexW3165795633MaRDI QIDQ5162868

J. Pascal Gollin, Sang-il Oum, Kevin Hendrey, Dillon Mayhew

Publication date: 5 November 2021

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

branch-widthrepresentable matroidsquasi-graphic matroidsbranch-depthtwisted matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First order convergence of matroids
• Sparsity. Graphs, structures, and algorithms
• The structure of the 3-separations of 3-connected matroids
• Some open problems on excluding a uniform matroid
• Graph minors. V. Excluding a planar graph
• Graph minors. X: Obstructions to tree-decomposition
• The dependence graph for bases in matroids
• The excluded minors for GF(4)-representable matroids
• Obstructions for bounded shrub-depth and rank-depth
• Branch-depth: generalizing tree-depth of graphs
• Describing quasi-graphic matroids
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Approximating clique-width and branch-width
• Obstructions to branch-decomposition of matroids
• The branchwidth of graphs and their cycle matroids
• Quasi‐graphic matroids*
• Comments on bases in dependence structures

This page was built for publication: Obstructions for Bounded Branch-depth in Matroids