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

DOI10.4153/CJM-1964-069-0zbMATH Open0123.00302OpenAlexW2001683877MaRDI QIDQ5735191FDOQ5735191

Authors: D. R. Fulkerson 

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

zbMATH Keywords

combinatorics

Cited In (18)

• Expected utility and the Siegel paradox: A generalization
• Convex sets of doubly stochastic matrices
• Every 7-regular digraph contains an even cycle
• Wide partitions, Latin tableaux, and Rota's basis conjecture
• Some combinatorial properties of centrosymmetric matrices
• On the separation power and the completion of partial latin squares
• Blocking and anti-blocking pairs of polyhedra
• Disjoint permutation matrices in complements of trees
• A proof of Fulkerson's characterization of permutation matrices
• Singular values, doubly stochastic matrices, and applications
• On the separation power and the completion of partial latin squares
• Systems of representatives
• Complexity of a disjoint matching problem on bipartite graphs
• Transversal matroid intersections and related packings
• Representing matrices
• Triangular (0,1)-matrices with prescribed row and column sums
• Additive decomposition of nonnegative matrices with applications to permanents and scalingt
• Investigations on an edge coloring problem

This page was built for publication: The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5735191)