Article contents
An Elementary Proof of Johnson–Dulmage–Mendelsohn's Refinement of Birkhoff's Theorem on Doubly Stochastic Matrices
Published online by Cambridge University Press: 20 November 2018
Summary
A purely combinatorial and elementary proof of Johnson-Dulmage-Mendelsohn's theorem, which gives a quite sharp upper bound on the number of permutation matrices needed for representing a doubly stochastic matrix by their convex combination, is given.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1979
References
- 2
- Cited by