Question

We want to select as many subsets of [n] as possible so that any two selected subsets have at least one element in common. What is the largest number of subsets we can select?
a) 2ⁿ
b) 2(n-1)
c) 2(n-2)
d) 2(n-3)