Abstract
In a recent issue of this journal Weyl1 proved a combinatorial lemma which was apparently considered first by P. Hall2 Subsequently Everett and Whaples 3 published another proof and a generalization of the same lemma. Their proof of the generalization appears to duplicate the usual proof of Tychonoff’s theorem.4 The purpose of this note is to simplify the presentation by employing the statement rather than the proof of that result. At the same time we present a somewhat simpler proof of the original Hall lemma.
*Received June 6. 1949
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Halmos, P.R., Vaughan, H.E. (2009). The Marriage Problem*. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_11
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_11
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive