Skip to main content
SpringerLink
Log in

Combinatorial Properties of Matrices of Zeros and Ones

  • Chapter
Book cover Classic Papers in Combinatorics

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

Abstract

This paper is concerned with a matrix A of m rows and n columns, all of whose entries are 0’s and 1’s. Let the sum of row i of A be denoted by r i (i = 1, ... , m) and let the sum of column i of A be denoted by S i (i = 1, ... ,n).

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

Access this chapter

Log in via an institution
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.

References

  1. Marshall Hall, An existence theorem for Latin squares,Bull. Amer. Math. Soc, 51(1945), 387-388.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Hall, On representatives of subsets,J. Lond. Math. Soc, 10(1935), 26-30.

    Article  MATH  Google Scholar 

  3. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities(Cambridge, 1952).

    Google Scholar 

  4. Dénes König, Theorie der endlichen und unendlichen Graphen(New York, 1950).

    Google Scholar 

  5. R. F. Muirhead, Some methods applicable to identities and inequalities of symmetric algebraic functions of n letters,Proc. Edinburgh Math. Soc, 21(1903), 144-157.

    Google Scholar 

  6. Oystein Ore, Graphs and matching theorems,Duke Math. J., 22(1955), 625-639.

    Article  MathSciNet  Google Scholar 

  7. H. J. Ryser, A combinatorial theorem with an application to Latin rectangles,Proc. Amer. Math. Soc, 2(1951), 550-552.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ohio State University, Ohio, USA

    H. J. Ryser

Authors
  1. H. J. Ryser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Brandeis University, Waltham, MA, 02454, USA

    Ira Gessel

  2. Department of Mathematics, Massachusetts Institute of Technology (MIT), Cambridge, MA, 02139, USA

    Gian-Carlo Rota

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

Ryser, H.J. (2009). Combinatorial Properties of Matrices of Zeros and Ones. 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_18

Download citation

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

  • 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

Search

Navigation