Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids

DOI10.1016/j.jctb.2007.02.005zbMath1125.05025OpenAlexW2161005000MaRDI QIDQ2384806

Bert Gerards, Jim Geelen, Geoffrey P. Whittle

Publication date: 10 October 2007

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

zbMATH Keywords

gridsmatroidsgraph minorsbranch-width

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (21)

Trees, grids, and MSO decidability: from graphs to matroids ⋮ Intertwining Connectivities for Vertex-Minors and Pivot-Minors ⋮ Matroid tree-width ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ The rank-width of edge-coloured graphs ⋮ Some recent progress and applications in graph minor theory ⋮ The binary matroids with no odd circuits of size exceeding five ⋮ Decomposition width of matroids ⋮ The extremal functions of classes of matroids of bounded branch-width ⋮ Obstructions for Bounded Branch-depth in Matroids ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ The contributions of W.T. Tutte to matroid theory ⋮ On Rota's conjecture and excluded minors containing large projective geometries. ⋮ Exposing 3-separations in 3-connected matroids ⋮ Excluding a bipartite circle graph from line graphs ⋮ Obstructions for bounded shrub-depth and rank-depth ⋮ Tangles, tree-decompositions and grids in matroids ⋮ Rank-width and vertex-minors ⋮ The grid theorem for vertex-minors ⋮ Matroids denser than a clique

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. V. Excluding a planar graph
• Recognizing graphic matroids
• On the excluded minors for the matroids of branch-width \(k\)
• Branch-width and Rota's conjecture
• Cliques in dense GF(\(q\))-representable matroids
• Disjoint cocircuits in matroids with large rank
• Branch-width and well-quasi-ordering in matroids and graphs.
• Branch-width, parse trees, and monadic second-order logic for matroids.
• Obstructions to branch-decomposition of matroids
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Menger's theorem for matroids

This page was built for publication: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids