Branch-width and Rota's conjecture

DOI10.1006/jctb.2002.2130zbMath1027.05018OpenAlexW2074859673MaRDI QIDQ1403924

James F. Geelen, Geoffrey P. Whittle

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2002.2130

zbMATH Keywords

matroidsexcluded minors

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (11)

On Rota's conjecture and nested separations in matroids ⋮ Fork-decompositions of matroids ⋮ Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids ⋮ Some recent progress and applications in graph minor theory ⋮ The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids ⋮ Stability, fragility, and Rota's conjecture ⋮ Decomposable polymatroids and connections with graph coloring ⋮ A Menger-like property of tree-cut width ⋮ Deletion-contraction to form a polymatroid ⋮ Recent work in matroid representation theory ⋮ On matroids of branch-width three.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Menger-like property of tree-width: The finite case
• Matroid representation over GF(3)
• On Reid's characterization of the ternary matroids
• Highly connected sets and the excluded grid theorem
• A simpler proof of the excluded minor theorem for higher surfaces
• The excluded minors for GF(4)-representable matroids
• Branch-width and well-quasi-ordering in matroids and graphs.
• Graph minors. IV: Tree-width and well-quasi-ordering
• Matroids and Graphs
• The Representation Problem for Independence Functions
• Graph minors. II. Algorithmic aspects of tree-width
• On Forbidden Minors for GF(3)
• Menger's theorem for matroids
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

This page was built for publication: Branch-width and Rota's conjecture