Article contents
Counting common representatives and symmetric chain decompositions
Published online by Cambridge University Press: 14 November 2011
Synopsis
We obtain lower bounds for the number of common systems of distinct representatives of two families of sets and the number of symmetric chain decompositions of certain ranked partially ordered sets.
- Type
- Research Article
- Information
- Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 100 , Issue 1-2 , 1985 , pp. 151 - 155
- Copyright
- Copyright © Royal Society of Edinburgh 1985
References
- 2
- Cited by