Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1990_02_01_dixmier: Dixmier proves two-sided bounds on g(k,n), the largest Frobenius number of a coprime k-element subset of the first n integers, which give the asymptotic n squared over k minus one for fixed k, the Erdős–Graham conjecture.
Linked from (1)
Graph