Covering a set by subsets
β
R.J. Clarke
π
Article
π
1990
π
Elsevier Science
π
English
β 310 KB
We give formulae for determining the number of ways of writing a finite set as the union of a given number of subsets, in such a way that none of the subsets may be omitted. In particular, we consider the case in which the elements of the set are identical.