Excluding a planar graph from GF (q)-representable matroids

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 6, 2007, Pages 971-998

  Geelen, Jim ^a   Gerards, Bert ^b,c   Whittle, Geoff ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CWI   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Branch width; Graph minors; Grids; Matroids

Indexed keywords

EID: 34548440304     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.02.005     Document Type: Article

References (14)

1. Erdo{combining double acute accent}s P., and Pósa L. On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9 (1962) 3-12
2. Geelen J.F., and Whittle G.P. Branch-width and Rota's Conjecture. J. Combin. Theory Ser. B 86 (2002) 315-330
3. Geelen J.F., and Whittle G.P. Cliques in dense GF (q)-representable matroids. J. Combin. Theory Ser. B 87 (2003) 264-269
4. Geelen J.F., Gerards A.M.H., and Whittle G.P. Branch-width and well-quasi-ordering in matroids and graphs. J. Combin. Theory Ser. B 84 (2002) 270-290
5. Geelen J.F., Gerards A.M.H., Robertson N., and Whittle G.P. On the excluded-minors for the matroids of branch-width k. J. Combin. Theory Ser. B 88 (2003) 261-265
6. Geelen J.F., Gerards A.M.H., and Whittle G.P. Disjoint cocircuits in matroids with large rank. J. Combin. Theory Ser. B 87 (2003) 270-279
7. Geelen J.F., Gerards A.M.H., Robertson N., and Whittle G.P. Obstructions to branch-decomposition of matroids. J. Combin. Theory Ser. B 96 (2006) 560-570
8. Hliněný P. Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96 (2006) 325-351
9. T. Johnson, N. Robertson, P.D. Seymour, Connectivity in binary matroids, handwritten manuscript
10. Mader W. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174 (1967) 265-268
11. Oxley J.G. Matroid Theory (1992), Oxford Univ. Press, New York
12. Robertson N., and Seymour P.D. Graph minors V: Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 92-114
13. Seymour P.D. Recognizing graphic matroids. Combinatorica 1 (1981) 75-78
14. Tutte W.T. Menger's theorem for matroids. J. Res. Natl. Bureau of Standards-B. Math. Math. Phys. 69B (1965) 49-53