Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-19T15:11:22.379Z Has data issue: false hasContentIssue false
  • English
  • Français

Sufficiency Conditions for the Existence of Transversals

Published online by Cambridge University Press:  20 November 2018

E. C. Milner  and
S. Shelah
E. C. Milner
Affiliation:
University of Calgary, Calgary, Alberta
S. Shelah
Affiliation:
University of Jerusalem, Jerusalem, Israel
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A transversal of a family of non-empty sets is a 1-1 map

such that φ(v) ∊ Fv (v ∊ I) . A number of problems in combinatorial mathematics reduce to the question of whether or not a certain family of sets has a transversal. An up-to-date account of this theory is to be found in the book by Mirsky [9]. The best known result of this kind is the following theorem.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 26 , Issue 4 , August 1974 , pp. 948 - 961
Copyright
Copyright © Canadian Mathematical Society 1974

References

1. Alexandroff, and Urysohn, , Mémoire sur les espaces topologiques compacts, Verh. Nederl. Akad. Wentensch. Sect. I, 14, Nr. 1, SI (1929).Google Scholar
2. Bollobas, B. and Milner, E. C., A theorem in transversal theory, Bull. London Math. Soc. 5 (1973), 267–270.Google Scholar
3. Brualdi, R. A. and Scrimger, E. B., Exchange systems, matchings and transversals, J. Combinatorial Theory 5 (1968), 244–257.Google Scholar
4. Damerell, R. M. and Milner, E. C., Necessary and sufficient conditions for transversals of countable set systems (to appear in J. Combinatorial Theory).Google Scholar
5. Folkman, J., Transversals of infinite families with finitely many infinite members, RAND Corporation Memorandum RM-5676-PR, 1968; J. Combinatorial Theory 9 (1970), 200–220.Google Scholar
6. Hall, Marshall, Jr., Distinct representatives of subsets, Bull. Amer. Math. Soc. 54 (1948), 922–926.Google Scholar
7. Hall, P., On representatives of subsets, J. London Math. Soc. 10 (1935), 26–30.Google Scholar
8. König, J., Graphok es matrixok, Mat. Lapok 38 (1931), 116–119.Google Scholar
9. Mirsky, L., Transversal theory (Academic Press, New York, 1971).Google Scholar
10. Williams, C. St. J. A. Nash, Proceedings of conference in combinatorics and graph theory, Oxford, 1972.Google Scholar
11. Neumer, W., Verallgemeinerung eines Satzes von Alexandrqff and Urysohn, Math. Z. 54 (1951), 254–261.Google Scholar
12. Rado, R., Note on the transfinite case of Hall's theorem on representatives, J. London Math. Soc. 4% (1967), 321-324. 13 S. Shelah, A substitute for HalVs theorem for families with infinite sets, J. Combinatorial Theory (A) 16 (1974), 199–208.Google Scholar