Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1971_01_01_kleitman: Kleitman proves that a family of subsets of [n] with no A ∪ B = C among distinct members has at most (1+o(1)) binom(n, n/2) sets, answering both of the problem's questions; credited by the site's curator.
Linked from (1)
Graph