Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1996_01_01_ahlswede_khachatrian: The maximum is attained by the integers up to N divisible by one of 2q_1, ..., 2q_j, q_1 ... q_j for some j, where q_1 < ... < q_r are the prime factors of N, as Erdős conjectured after the original guess failed.
Linked from (1)
Graph