Given a the set $a = \{1,...,n\}$ and let $b$ denote a set of subsets of $a$.
Find a subset of $c$ of $b$ so that the union of all subsets in $c$ is equal to $a$ and the intersection of any of the subsets of $c$ is empty.
How is this problem called in literature, i tried unique union, but thats not right.