On the excluded minors for the matroids of branch-width k

Authors:
J. F. Geelen;A. M. H. Gerards;N. Robertson;G. P. Whittle
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada, N2L 3G1;CWI, Postbus 94079, 1090 GB Amsterdam, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, Postbus 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics, 231 West 18th Avenue, Ohio State University, Columbus, OH;School of Mathematical and Computing Sciences, Victoria University, Wellington, New Zealand
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Rank-width and vertex-minors

Journal of Combinatorial Theory Series B
Trees, grids, and MSO decidability: from graphs to matroids

Theoretical Computer Science - Parameterized and exact computation
Obstructions to branch-decomposition of matroids

Journal of Combinatorial Theory Series B
Branch-width, parse trees, and monadic second-order logic for matroids

Journal of Combinatorial Theory Series B
Matroid tree-width

European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Excluding a planar graph from GF(q)-representable matroids

Journal of Combinatorial Theory Series B
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tangles, tree-decompositions and grids in matroids

Journal of Combinatorial Theory Series B
Finding branch-decompositions and rank-decompositions

ESA'07 Proceedings of the 15th annual European conference on Algorithms
F-rank-width of (edge-colored) graphs

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond

Hi-index	0.00

We prove that the excluded minors for the class of matroids of branch-width k have size at most (6k - 1)/5.