Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_09_13_hunter: Hunter's observation that the middle layer and Kleitman's solution of Problem 447 give F(n) asymptotic to the central binomial coefficient, so the answer is yes with c the square root of 2 over pi; credited by the curator.
Linked from (1)
Graph