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.00302OpenAlexW2001683877MaRDI QIDQ5735191
Publication date: 1964
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1964-069-0
Related Items
Expected utility and the Siegel paradox: A generalization, Complexity of a disjoint matching problem on bipartite graphs, Singular values, doubly stochastic matrices, and applications, Every 7-regular digraph contains an even cycle, Representing matrices, Blocking and anti-blocking pairs of polyhedra, Additive decomposition of nonnegative matrices with applications to permanents and scalingt, Wide partitions, Latin tableaux, and Rota's basis conjecture, Triangular (0,1)-matrices with prescribed row and column sums, On the separation power and the completion of partial latin squares, On the separation power and the completion of partial latin squares, Transversal matroid intersections and related packings, A proof of Fulkerson's characterization of permutation matrices, Some combinatorial properties of centrosymmetric matrices, Disjoint permutation matrices in complements of trees, Systems of representatives, Investigations on an edge coloring problem, Convex sets of doubly stochastic matrices
