Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_03_31_hegyvari: Hegyvári bounds the common values of k(m-k) and l(n-l) by a divisor count of m^2-n^2, which is m^(o(1)), and shows that every size s occurs for infinitely many pairs, answering both questions for m different from n.
Linked from (1)
Graph