The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
From MaRDI portal
Publication:5735191
DOI10.4153/CJM-1964-069-0zbMath0123.00302MaRDI QIDQ5735191
Publication date: 1964
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Blocking and anti-blocking pairs of polyhedra, On the separation power and the completion of partial latin squares, On the separation power and the completion of partial latin squares, Systems of representatives, Every 7-regular digraph contains an even cycle, Representing matrices, Triangular (0,1)-matrices with prescribed row and column sums, A proof of Fulkerson's characterization of permutation matrices, Some combinatorial properties of centrosymmetric matrices, Wide partitions, Latin tableaux, and Rota's basis conjecture, Convex sets of doubly stochastic matrices, Singular values, doubly stochastic matrices, and applications, Expected utility and the Siegel paradox: A generalization, Investigations on an edge coloring problem, Additive decomposition of nonnegative matrices with applications to permanents and scalingt, Disjoint permutation matrices in complements of trees, Transversal matroid intersections and related packings
