A proof of Fulkerson's characterization of permutation matrices

DOI10.1016/0024-3795(75)90124-XzbMath0316.05019MaRDI QIDQ1221117

Allan B. Cruse

Publication date: 1975

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Stochastic matrices (15B51) Polytopes and polyhedra (52Bxx)

Related Items

Singular values, doubly stochastic matrices, and applications, A generalization of a theorem of König, Representing matrices, Additive decomposition of nonnegative matrices with applications to permanents and scalingt, On matroid intersections, Some combinatorial properties of centrosymmetric matrices, An unbounded matroid intersection polyhedron, Analytic proofs of a network feasibility theorem and a theorem of Fulkerson

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on symmetric doubly-stochastic matrices
• Blocking pairs of polyhedra arising from network flows
• Restricted patterns
• Convex sets of doubly stochastic matrices
• A constructive decomposition and Fulkerson's characterization of permutation matrices
• Extremal configurations and decomposition theorems. I
• Term ranks and permanents of nonnegative matrices
• Multidimensional stochastic matrices and patterns
• Systems of Distinct Representations and Linear Programming
• Results and problems in the theory of doubly-stochastic matrices
• Blocking and anti-blocking pairs of polyhedra
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones