Skip to main content

Flows, Connectivity and Matching

  • Chapter
  • First Online:
Modern Graph Theory

Part of the book series: Graduate Texts in Mathematics ((GTM,volume 184))

  • 9510 Accesses

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 1A 1,, a mA m?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics