Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_06_16_hunter_sawhney: The observation, recorded on the site, that Bloom's Theorem 3 applied by greedy removal gives k(N) = (1 - o(1)) log N disjoint unit-sum subsets of {1, ..., N}, which refutes the guess k(N) = o(log N).
Linked from (1)
Graph