Abstract
Let A be a set and let A be a collection of subsets of A. Conditions are given that must hold if a partition of A is a subset of A. The main idea presented is a generalization of several methods that have been used to prove certain packing theorems.
| Original language | English |
|---|---|
| Pages (from-to) | 272-278 |
| Number of pages | 7 |
| Journal | Journal of Combinatorial Theory |
| Volume | 8 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1970 |