Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1965_12_01_erdos_renyi: Theorem 1 of Erdős and Rényi (J. Analyse Math. 1965) equidistributes the subset sums of about 2 log_2 N random elements of an abelian group of order N, so g_eps(N) <= (2+o(1)) log_2 N + O_eps(1); refereed, superseded in 1976.
1976_01_01_erdos_hall: The Theorem of Erdős and Hall (Houston J. Math. 1976) equidistributes the subset sums of almost all choices of (1+o(1)) log_2 N elements of an abelian group of order N, so g_eps(N) = (1+o(1)) log_2 N; refereed, site credit.
Linked from (1)
Graph