Skip to main content

On Representatives of Subsets

  • Chapter
Book cover Classic Papers in Combinatorics

Part of the book series: Modern Birkhäuser Classics ((MBC))

Abstract

Let a set S of mn things be divided into m classes of n things each in two distinct ways, (a) and (b); so that there are m (a)-classes and m (b)-classes. Then it is always possible to find a set R of m things of S which is at one and the same time a C.S.R. (= complete system of rcpresentatives) for the (a)-classes, and also a C.S.R. for the (b)-classes.

†Received 23 April, 1934; read. 26 April, 1934.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Hall†, P. (2009). On Representatives of Subsets. 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_4

Download citation

  • DOI: https://doi.org/10.1007/978-0-8176-4842-8_4

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-0-8176-4841-1

  • Online ISBN: 978-0-8176-4842-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics