Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1994_01_01_kahn: Kahn proves that the least size of an intersecting family of n-sets missed by every set of fewer than n elements is O(n), settling the Erdős–Lovász problem; refereed in J. Amer. Math. Soc. and credited by the site's curator.
Linked from (1)
Graph