Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_08_03_alon: Alon's note builds, from random halves of the lines of a projective plane, a partial design with blocks of size above 0.4 root n in which every blocking set meets some block in at least 0.1 log n points; the answer is no.
Linked from (1)
Graph