Combinatorial Properties of Matrices of Zeros and Ones

@article{Ryser1957CombinatorialPO,
title={Combinatorial Properties of Matrices of Zeros and Ones},
author={H. J. Ryser},
journal={Canadian Journal of Mathematics},
year={1957},
volume={9},
pages={371 - 377}
}

This paper is concerned with a matrix A of m rows and n columns, all of whose entries are 0's and l'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 paper continues a study appearing in (5) of the combinatorial properties of 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… Expand

This paper continues the study appearing in (9) and (10) of the combinatorial properties of a matrix A of m rows and n columns, all of whose entries are 0's and l's. Let the sum of row i of A be… Expand

Let A be a. matrix of m rows and n columns and let the entries of A be the integers 0 and 1. We call such a matrix a (0, 1) -matrix of size m by n. The 2 (0, 1)-matrices of size m by n play a… Expand

This work provides a characterization of vectors (A,B) which are realizable, and obtains an optimal algorithm for constructing such a matrix when possible and points out an application of this algorithm to the heuristic solution of network flow problems.Expand

The methods explained here are applicable to a large number of problems relating to the symmetric algebraic functions of n letters, and the special results here deduced from them are merely specimens… Expand

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… Expand