Factorizations of covers
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of T is contained in at least k members of S. This thesis examines partitions of S such that each part is a cover for T. It is mainly concerned with extremal problems of the type "find the smallest...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1989
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59522 |