Skip to content
Get started

Committees that never contain each other

MediumCombinatorics5 min

A firm has 88 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)+
  1. Order the partners at random and build the chain of prefixes.
  2. How many chains pass through a given kk-set? Can one chain meet the family twice?
  3. Which single level of subsets is biggest?

Answer

Reveal 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

Related questions