Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T14:56:25.048Z Has data issue: false hasContentIssue false
  • English
  • Français

Traces of Matrices of Zeros and Ones

Published online by Cambridge University Press:  20 November 2018

H. J. Ryser
H. J. Ryser*
Affiliation:
The Ohio State University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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 denoted by ri and let the sum of column j of A be denoted by Sj. We call R = (r1, … , rm) the row sum vector and S = (s1 . . , sn) the column sum vector of A. The vectors R and S determine a class

1.1

consisting of all (0, 1)-matrices of m rows and n columns, with row sum vector R and column sum vector S. The majorization concept yields simple necessary and sufficient conditions on R and S in order that the class 21 be non-empty (4; 9). Generalizations of this result and a critical survey of a wide variety of related problems are available in (6).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 12 , 1960 , pp. 463 - 476
Copyright
Copyright © Canadian Mathematical Society 1960

References

1. Ford, L.R. Jr., and Fulkerson, D.R., A simple algorithm for finding maximal network flows and an application to the Hitchcock problem, Can. J. Math., 9 (1957), 210–218.Google Scholar
2. Fulkerson, D.R., A network-flow feasibility theorem and combinatorial applications, Can. J. Math., 11 (1959), 440–451.Google Scholar
3. Fulkerson, D.R., Zero-one matrices with zero trace, Rand Corporation publication P-1618.Google Scholar
4. Gale, David, A theorem onflows in networks, Pac. J. Math., 7 (1957), 1073–1082.Google Scholar
5. Haber, R.M., Term rank of 0, 1 matrices, to appear in 111. J. Math.Google Scholar
6. Hoffman, Alan J., Some recent applications of the theory of linear inequalities to extermal combinatorial analysis, to appear in the American Mathematical Society publication of the symposium on combinatorial designs and analysis.Google Scholar
7. König, Dénes, Théorie der endlichen und unendlichen Graphen (New York, 1950).Google Scholar
8. Ore, Oystein, Graphs and matching theorems, Duke Math. J., 22 (1955), 625–639.Google Scholar
9. Ryser, H.J., Combinatorial properties of matrices of zeros and ones, Can. J. Math., 9 (1957), 371–377.Google Scholar
10. Ryser, H.J., The term rank of a matrix, Can. J. Math., 10 (1958), 57–65.Google Scholar