Committees that never contain each other
A firm has partners. It wants a collection of distinct committees (subsets of partners) such that no committee is contained in another committee of the collection. What is the largest possible size of such a collection?
Show hints (3)+
- Order the partners at random and build the chain of prefixes.
- How many chains pass through a given -set? Can one chain meet the family twice?
- Which single level of subsets is biggest?
Answer
Reveal answer →Final answer
70
Create a free account to see the full worked solution and track your progress.
Interview format: Hedge Fund Quant, Systematic & Data-Driven Trading