Towards a Matroid-Minor Structure Theory

Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Volumn , Issue , 2007, Pages

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b CWI   (Netherlands)

^c VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Graphs minor project; Matroids; Rota's conjecture

Indexed keywords

EID: 84920751479     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198571278.003.0005     Document Type: Chapter

References (33)

1. R. E. Bixby, On Reid's characterization of the ternary matroids, J. Combin. Theory Ser. B 26 (1979) 174-204.
2. J. Dharmatilake, A min-max theorem using matroid separations, Matroid Theory (Seattle WA 1995) 333-342, Contemp. Math. 197 Amer. Math. Soc., Providence RI (1996).
3. R. Diestel, K. Gorbanov, T. Jensen, and K. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B 75 (1999) 61-73.
4. T. Dowling, A class of geometric lattices based on finite groups, J. Combin. Theory Ser. B 14 (1973) 61-86.
5. J. Geelen, A. M. H. Gerards, and A. Kapoor, The excluded minors for GF(4)-representable matroids, J. Combin. Theory Ser. B 79 (2000) 247-299.
6. J. Geelen, A. M. H. Gerards, N. Robertson, and G. Whittle, On the excluded minors of matroids of branch width k, J. Combin. Theory Ser. B 88 (2003) 261-265.
7. J. Geelen, A. M. H. Gerards, N. Robertson, and G. Whittle, Obstructions to branch decompositions in matroids, J. Combin. Theory Ser. B 96 (2006) 560-570.
8. J. Geelen, A. M. H. Gerards, and G. Whittle, Branch-width and well-quasiordering in matroids and graphs, J. Combin. Theory Ser. B 84 (2002) 270-290.
9. J. Geelen, A. M. H. Gerards, and G. Whittle, Disjoint cocircuits in matroids with large rank, J. Combin. Theory Ser. B 87 (2003) 270-279.
10. J. Geelen, B. Gerards, and G. Whittle, Tangles, tree decompositions and grids in matroids, J. Combin. Theory Ser. B, to appear.
11. J. Geelen, B. Gerards, and G. Whittle, On Rota's Conjecture and excluded minors containing large projective geometries, to appear in J. Combin. Theory Ser. B 96 (2006) 405-525.
12. J. Geelen, B. Gerards, and G. Whittle, Excluding a planar graph from GF(q)-representable matroids, submitted.
13. J. Geelen, B. Gerards, and G. Whittle, Inequivalent representations of matroids I: An overview, in preparation.
14. J. Geelen and G. Whittle, Branch width and Rota's conjecture, J. Combin. Theory Ser. B 86 (2002) 315-330.
15. J. Geelen and G. Whittle, Cliques in dense GF(q)-representable matroids, J. Combin. Theory Ser. B 87 (2003) 264-269.
16. P. Hliněný, Branch-width, parse trees, and monadic second-order logic for matroids, preprint, Extended abstract in STACS 2003.
17. P. Hliněný and G. Whittle, Matroid tree width, to appear in European Journal of Combinatorics.
18. T. Johnson, N. Robertson, and P. D. Seymour, Connectivity in binary matroids, Handwritten manuscript.
19. T. Lazarson, The representation problem for independence functions, J. London Math. Soc. 33 (1958) 21-25.
20. J. G. Oxley, D. L. Vertigan, and G. P. Whittle, On inequivalent representations of matroids over finite fields, J. Combin. Theory Ser. B 67 (1996) 325-343.
21. N. Robertson and P. D. Seymour, Graph minors. IV. Tree-width and wellquasi- ordering, J. Combin. Theory Ser. B 48 (1990) 227-254.
22. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92-114.
23. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree decomposition, J. Combin. Theory Ser. B 52 (1991) 153-190.
24. N. Robertson and P. D. Seymour, Graph minors. X111. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995) 65-110.
25. N. Robertson and P. D. Seymour, Graph minors. XX. Wagner's Conjecture, J. Combin. Theory Ser. B 92 (2004) 325-357.
26. N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994) 323-348.
27. G.-C. Rota, Combinatorial theory, old and new, in Proc. Internat. Cong. Math. (Nice, Sept. 1970) Gauthier-Chichester (1970) pp. 229-233.
28. P. D. Seymour, Matroid representation over GF(3), J. Combin. Theory Ser. B 26 (1979) 159-173.
29. W. T. Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Math. Soc. 88 (1958) 144-174.
30. W. T. Tutte, Menger's theorem for matroids, Journal of Research of the National Bureau of Standards-B, Mathematics and Mathematical Physics 69 B (1965) 49-53.
31. G. P. Whittle, Stabilizers of classes of representable matroids, J. Combin. Theory Ser. B 77 (1999) 39-72.
32. T. Zaslavsky, Biased graphs. II. The three matroids, J. Combin. Theory Ser. B 51 (1991) 46-72.
33. T. Zaslavsky, A mathematical bibliography of signed and gain graphs and allied areas. Manuscript prepared with Marge Pratt. Electron. J. Combin. 5 (1998) Dynamic Surveys, pp. 8, 124 (electronic).