Combinatorial Properties of Matrices of Zeros and Ones
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 ri (i = 1, ... , m) and let the sum of column i of A be denoted by Si (i = 1, ... ,n).
- 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
- 7.H. J. Ryser, A combinatorial theorem with an application to Latin rectangles,Proc. Amer. Math. Soc, 2(1951), 550-552.Google Scholar