In the final chapter of this anthology, we reprint two recent papers which show that the possibilities in matroid theory may not be as wide as has been thought.
KeywordsProjective Geometry Universal Model Exceptionable Point Combinatorial Geometry Series Class
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Seymour, P.D.: Some applications of matroid decomposition, Algebraic Methods in Graph Theory, Vol. I, II (Proc. Conf., Szeged, 1978), pp. 713–726, Colloq. Math. Soc. János Bolyai 25, North-Holland, Amsterdam, 1981.Google Scholar
- Truemper, K.: A decomposition theory for matroids. III: Decomposition conditions, preprint.Google Scholar
- Kahn, J. and Kung, J.P.S.: A classification of modularly complemented lattices, Europ. J. Combin., to appear.Google Scholar
- Kung, J.P.S.: Numerically regular hereditary classes of combinatorial geometries, Geometriae Dedicata, to appear.Google Scholar
- 2.R. E. Bixby and W. H. Cunningham, Matroids, graphs, and 3-connectivity, in “Graph Theory and Related Topics” (J. A. Bondy and U. S. R. Murty, Eds.), pp. 91–103, Academic Press, New York, 1979.Google Scholar
- 5.W. H. Cunningham, “A Combinatorial Decomposition Theory,” Thesis (Research Report CORR 74-13), University of Waterloo, 1973.Google Scholar
- 6.W. H. Cunningham, On matroid connectivity, to appear.Google Scholar
- 7.A. K. Kelmans, A theory of 3-connected graphs, in “Proceedings, Trudi Colloquium on Algebraic Methods in Graph Theory,” Szeged, Hungary, in press.Google Scholar
- 8.P. D. Seymour, Matroids and multicommodity flows, European J. Combinatorics, in press.Google Scholar
- 9.P. D. Seymour, On Tutte’s characterization of graphic matroids, in “Combinatorics 1979,” Annals of Discrete Mathematics, North-Holland, Amsterdam, in press.Google Scholar
- 10.P. D. Seymour, On Tutte’s extension of the four-colour problem, J. Combinatorial Theory Ser. B, in press.Google Scholar
- 12.W. T. Tutte, “Connectivity in Graphs,” Univ. of Toronto Press, Toronto, 1966.Google Scholar
- 16.D. J. A. Welsh, “Matroid Theory,” Academic Press, New York, 1976.Google Scholar
- 2.G. Birkhoff, Lattice theory, 3rd ed., Amer. Math. Soc. Colloq. Publ., vol. 25, Amer. Math. Soc., Providence, R.I., 1967.Google Scholar
- 5.P. Doubilet, G.-C. Rota and R. Stanley, On the foundations of combinatorial theory. VI: The idea of generating function, Sixth Berkeley Sympos. on Math. Statist, and Prob., Vol. II: Probability Theory, Univ. California, Berkeley, Calif., 1972, pp. 267–318.Google Scholar
- 6.T. A. Dowling, A q-analog of the partition lattice, A Survey of Combinatorial Theory (J. N. Srivastava, editor), North-Holland, Amsterdam, 1973, pp. 101–115.Google Scholar
- 8.C. Greene, Lectures in combinatorial geometries, Notes from the NSF Seminar in Combinatorial Theory, Bowdoin College, 1971, unpublished.Google Scholar
- 10.D. Kelly and G.-C. Rota, Some problems in combinatorial geometry, A Survey of Combinatorial Theory (J. N. Srivastava, editor), North-Holland, Amsterdam, 1973, pp. 309–312.Google Scholar
- 14.T. Zaslavsky, Biased graphs, preprint, 1977.Google Scholar
© Springer Science+Business Media New York 1986