Transversal Theory and Matroids
Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 1323-1330

Voir la notice de l'article provenant de la source Cambridge University Press

In this paper I use techniques developed by Mirsky and Perfect (5) to generalize the extremely close relationship between transversal theory and the theory of matroids or independence structures. I extend in two directions a fundamental theorem of Rado (8) and use the techniques of Mirsky and Perfect to obtain easy proofs of known and unknown results about systems of representatives with repetition. 2. Basic concepts. In this section I review the results used subsequently. Throughout the paper, S will denote a finite set and A will denote the collection of subsets of S, {Ai i ∈ I}, where Iis a finite index set. |K| will denote the cardinality of a set K and I use the notation
Welsh, D. J. A. Transversal Theory and Matroids. Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 1323-1330. doi: 10.4153/CJM-1969-145-0
@article{10_4153_CJM_1969_145_0,
     author = {Welsh, D. J. A.},
     title = {Transversal {Theory} and {Matroids}},
     journal = {Canadian journal of mathematics},
     pages = {1323--1330},
     year = {1969},
     volume = {21},
     number = {1},
     doi = {10.4153/CJM-1969-145-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-145-0/}
}
TY  - JOUR
AU  - Welsh, D. J. A.
TI  - Transversal Theory and Matroids
JO  - Canadian journal of mathematics
PY  - 1969
SP  - 1323
EP  - 1330
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-145-0/
DO  - 10.4153/CJM-1969-145-0
ID  - 10_4153_CJM_1969_145_0
ER  - 
%0 Journal Article
%A Welsh, D. J. A.
%T Transversal Theory and Matroids
%J Canadian journal of mathematics
%D 1969
%P 1323-1330
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-145-0/
%R 10.4153/CJM-1969-145-0
%F 10_4153_CJM_1969_145_0

[1] 1. Edmonds, J. and Fulkerson, D. R., Transversals and matroid partitions, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 147–153. Google Scholar

[2] 2. Ford, L. R., Jr. and Fulkerson, D. R., Flows in networks (Princeton Univ. Press, Princeton, N.J., 1962). Google Scholar

[3] 3. Halmos, P. R. and Vaughan, H. E., The marriage problem, Amer. J. Math. 72 (1950), 214–215. Google Scholar

[4] 4. Hoffman, A. J. and Kuhn, W. H., Systems of distinct representatives and linear programming, Amer. Math. Monthly 63 (1956), 455–460. Google Scholar

[5] 5. Mirsky, L. and Perfect, H., Applications of the notion of independence to problems of combinatorial analysis, J. Combinatorial Theory 2 (1967), 327–357. Google Scholar

[6] 6. Mirsky, L. and Perfect, H., Systems of representatives, J. Math. Anal. Appl. 15 (1966), 520–568. Google Scholar

[7] 7. Perfect, H., Abstract linear dependence, Seminar Rep. Univ. Sheffield, England, 1967. Google Scholar

[8] 8. Rado, R., A theorem on independence relations, Quart. J. Math. Oxford Ser. 13 (1942), 83–89. Google Scholar

[9] 9. Rado, R., Abstract linear dependence, Colloq. Math. 14 (1966), 257–264. Google Scholar

[10] 10. Welsh, D. J. A., Some applications of a theorem by Rado, Mathematika 15 (1968), 199–203. Google Scholar

[11] 11. Whitney, H., On the abstract properties of linear dependence, Amer. J. Math. 57 (1935), 509–533. Google Scholar

Cité par Sources :