Hostname: page-component-848d4c4894-x24gv Total loading time: 0 Render date: 2024-05-22T01:23:13.259Z Has data issue: false hasContentIssue false
  • English
  • Français

The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones

Published online by Cambridge University Press:  20 November 2018

D. R. Fulkerson
D. R. Fulkerson*
Affiliation:
The Rand Corporation and University of California, Berkeley
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.

A well-known consequence of the König theorem on maximum matchings and minimum covers in bipartite graphs (5) or of the P. Hall theorem on systems of distinct representatives for sets (4) asserts that an n by n (0, 1)-matrix A having precisely p ones in each row and column can be written as a sum of p permutation matrices:

Our main objective is a generalization of (1.1) along the following lines. Let A be an arbitrary m by n (0, 1)-matrix. Call an m by n (0, 1)-matrix P a permutation matrix if PPT = I, where PT is the transpose of P and I is the identity matrix of order m.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 16 , 1964 , pp. 729 - 735
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Ford, L. R. Jr. and Fulkerson, D. R., Flows in networks (Princeton, 1962).Google Scholar
2. Fulkerson, D. R. and Ryser, H. J., Widths and heights of (0, l)-matrices, Can. J. Math., 13 (1961), 239–255.Google Scholar
3. Haber, R. M., s, Can. J. Math., 15, (1963), 188–192.Google Scholar
4. Hall, P., On representatives of subsets, J. Lond. Math. Soc, 10 (1935), 26–30.Google Scholar
5. Kônig, D., Théorie der endlichen und unendlichen Graphen (New York, 1950).Google Scholar
6. Mann, H. B. and Ryser, H. J., Systems of distinct representatives, Amer. Math. Monthly, 60 (1953), 397–401.Google Scholar
7. Ryser, H. J., Combinatorial properties of matrices of zeros and ones, Can. J. Math., 9 (1957), 371–377.Google Scholar
8. Ryser, H. J., The term rank of a matrix, Can. J. Math., 10 (1958), 57–65.Google Scholar
9. Ryser, H. J., Traces of matrices of zeros and ones, Can. J. Math., 12 (1960), 463–476.Google Scholar