# 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}
}```
• H. Ryser
• Published 1957
• Mathematics
• Canadian Journal of Mathematics
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).
619 Citations

### The Term Rank of a Matrix

• H. Ryser
• Mathematics
Canadian Journal of Mathematics
• 1958
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

### Traces of Matrices of Zeros and Ones

• H. Ryser
• Mathematics
Canadian Journal of Mathematics
• 1960
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

### Matrices of zeros and ones

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

### Realization of Matrices and Directed Graphs

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.