Article contents
The lattice of stable marriages and permutations
Published online by Cambridge University Press: 09 April 2009
Abstract
Recently, we have introduced the notion of stable permutations in a Latin rectangle L(r×c) of r rows and c columns. In this note, we prove that the set of all stable permutations in L (r×c) forms a distributive lattice which is Boolean if and only if c ≤ 2.
Keywords
MSC classification
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 33 , Issue 3 , December 1982 , pp. 401 - 410
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 2
- Cited by