Abstract
At the prom, 300 students took part. They did not all know each other; in fact, every girl knew exactly 50 boys and every boy knew exactly 50 girls (we assume, as before, that acquaintance is mutual).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lovász, L., Pelikán, J., Vesztergombi, K. (2003). Matchings in Graphs. In: Discrete Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-21777-0_10
Download citation
DOI: https://doi.org/10.1007/0-387-21777-0_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95585-8
Online ISBN: 978-0-387-21777-2
eBook Packages: Springer Book Archive