Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1981_07_01_chung_graham: Theorem 1 of Chung and Graham: every sequence in [0,1] has clustering measure at most (1 + sum of 1/F_2k)^(-1) = 0.3944..., below one over root five, and Theorem 2 shows the constant is sharp; announced 1981, proved 1984.
Linked from (1)
Graph