Collection of subsets with more than $n\choose n/2$ elements must have set contained in another

75 Views Asked by At

I have a set $A$ of size $n$.
I have a collection of subsets of $A$ that contains $k>{n\choose n/2} $ elements.
I want to prove that there are two sets $B, C$ in this collection such that $B\subset C$.
Any idea ?