Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_10_19_plasma_ai: Plasma AI proves that a coloring of 1 to N by k colors whose every class lies in a single sum-free Bohr arc has N+1 at most 8^k, the exponential bound of Problem 483 for that class of colorings. Author-recorded at tier 0; catalog acceptance is pending.
Linked from (1)
Graph