Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T10:39:49.897Z Has data issue: false hasContentIssue false
  • English
  • Français

Systems of representatives with repetition

Published online by Cambridge University Press:  24 October 2008

L. Mirsky
L. Mirsky
Affiliation:
University of Sheffield
Get access Rights & Permissions [Opens in a new window]

Extract

The part of combinatorial analysis which deals with systems of representatives draws on a variety of different sources. Thus the theory of graphs, the theory of flows in networks, linear programming, and integral linear programming all provide relevant methods and arguments. Nevertheless, it is in all likelihood possible to give a unified set-theoretic account of the subject, based in the main on Hall's criterion for the existence of transversals and on a certain generalization of the Schröder–Bernstein theorem. This approach has the added advantage of greater flexibility since it enables us sometimes to cope with transfinite situations where other methods may be only applicable to finite cases.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 63 , Issue 4 , October 1967 , pp. 1135 - 1140
Copyright
Copyright © Cambridge Philosophical Society 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Ford, L. R. Jr. and Fulkerson, D. R.Flows in networks (Princeton, 1962).Google Scholar
(2)Hall, M. Jr. Distinct representatives of subsets. Bull. Amer. Math. Soc. 54 (1948), 922–926.CrossRefGoogle Scholar
(3)Hall, P.On representatives of subsets. J. London Math. Soc. 10 (1935), 26–30.CrossRefGoogle Scholar
(4)Hoffman, A. J. and Kuhn, H. W.Systems of distinct representatives and linear programming. Amer. Math. Monthly 63 (1956), 455–460.Google Scholar
(5)Knaster, B.Un théorème sur les fonctions d'ensembles. Ann. Soc. Polon. Math. 6 (1927), 133.Google Scholar
(6)Mirsky, L.Transversals of subsets. Quart. J. Math. (Oxford), (2), 17 (1966), 58–60.CrossRefGoogle Scholar
(7)Mirsky, L. and Perfect, Hazel. Systems of representatives. J. Math. Analysis Appl. 15 (1966), 520–568.CrossRefGoogle Scholar
(8)Mirsky, L. and Hazel., PerfectApplications of the notion of independence to problems of combinatorial analysis. J. Combinatorial Th. To appear.Google Scholar
(9)Perfect, Hazel and Pym, J. S.An extension of Banach's mapping theorem, with applications to problems concerning common representatives. Proc. Cambridge Philos. Soc. 62 (1966), 187–192.CrossRefGoogle Scholar