Abstract
Given a collection of boys and girls, when can all the girls find husbands that they know? For a subgroup H of a finite group G, are there group elements g 1,…, g n such that {g 1H,…, g nH} is the collection of left cosets and {Hg 1,…, Hg n} is the collection of right cosets of H? Given sets A 1,…, A m, are there distinct elements a 1 ∈ A 1,…, a m ∈ A m?
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bollobás, B. (1998). Flows, Connectivity and Matching. In: Modern Graph Theory. Graduate Texts in Mathematics, vol 184. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0619-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0619-4_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98488-9
Online ISBN: 978-1-4612-0619-4
eBook Packages: Springer Book Archive