Abstract
After our discussion of the basics of matroid theory in the previous chapter, we are now going to study in detail the most important classes of matroids: Linear matroids, binary and regular matroids, graphic and transversal matroids. The emphasis lies here on the characterization of these matroids and on applications to concrete combinatorial problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Rado, R.: Note on independence functions. Proc. London Math. Soc. 7, 300–320 (1957).
See also Erdös-Turan. Tutte, W. T.:A homotopy theorem for matroids, I and II. Trans. Amer. Math. Soc. 88, 144–174 (1958).
See also Erdös-Turan. Tutte, W. T.:Matroids and graphs. Trans. Amer. Math. Soc. 90, 527–552 (1959).
See also Erdös-Turan. Tutte, W. T.:Lectures on matroids. J. Res. Nat. Bur. Stand. 69B, 1–48 (1965).
Ingleton, A. W.: Representation of matroids. Combinatorial Math. and its Applications (Welsh, ed.), 149–169. London, New York: Acad. Press (1971).
Piff, M. J.-Welsh, D. J. A.: On the vector representation of matroids. J. London Math. Soc. 2 284–288 (1970).
Mason, J. H.: Geometrical realization of combinatorial geometries. Proc. Amer. Math. Soc. 30 (1), 15–21 (1971).
Davis, R. L.: The number of structures of finite relations. Proc. Amer. Math. Soc. 4, 486–495 (1953).
Lehman, A.: A solution of the Shannon switching game. SIAM J. 12, 687–725 (1964).
Minty, G. J.: On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming. Journ. Math. Mech. 15, 485–520 (1960).
See also Erdös-Turan. Tutte, W. T.:Lectures on matroids. J. Res. Nat. Bur. Stand. 69B, 1–48 (1965).
Bland, R. G.-Las Vergnas, M.: Orientability of matroids. J. Comb. Theory (B) 24, 94–123 (1978).
Biggs, N.: Algebraic Graph Theory. London: Cambridge University Press (1974).
Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34, 339–362 (1932).
Whitney, H.: Congruent graphs and the connectivity of graphs. Amer. J. Math. 54, 150–168 (1932).
Whitney, H.: Planar graphs. Fund. Math. 21, 73–84 (1933).
Graver, J. E.-Yackel, J.: Some graph theoretic results associated with Ramsey’s theorem. J. Comb. Theory 4, 125–175 (1968).
Ford, L. R.-Fulkerson, D. R.: Flows in Networks. Princeton: Princeton Univ. Press (1962).
Duffin, R.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303–318 (1965).
Brualdi, R. A.: A very general theorem on systems of distinct representatives. Trans. Amer. Math. Soc. 140, 149–160 (1969).
Brualdi, R. A.: Generalized transversal theory. Théorie des Matroides (Bruter, ed.), 5–31. Lecture Notes Math. 211, Springer-Verlag (1971).
Brualdi, R. A.: On families of finite independence structures. Proc. London Math. Soc. 22, 265–293 (1971).
Ingleton, A. W.: A geometrical characterization of transversal independence structures. Bull. London Math. Soc. 3, 47–51 (1971).
Ingleton, A. W.: Transversal matroids and related structures. Higher Combinatorics (Aigner, ed.), 117–131. Dordrecht: Reidel (1977).
Ingleton, A. W.-Piff, M. J.: Gammoids and transversal matroids. J. Comb. Theory 15, 51–68 (1973).
Welsh, D. J. A.-Woodall, D. R.: Combinatorics (eds.). Combinatorics Inst. of Math. and Appl. Oxford (1972).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Aigner, M. (1979). Matroids: Further Theory. In: Combinatorial Theory. Grundlehren der mathematischen Wissenschaften, vol 234. Springer, New York, NY. https://doi.org/10.1007/978-1-4615-6666-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6666-3_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4615-6668-7
Online ISBN: 978-1-4615-6666-3
eBook Packages: Springer Book Archive