Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1969_06_01_kleitman: Kleitman proves that the number of antichains of subsets of [n], Dedekind's number, is 2 to the (1+o(1)) binom(n, n/2); refereed in Proc. Amer. Math. Soc. and credited by the site's curator.
Linked from (1)
Graph