Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2020_06_04_schoen: Schoen's Theorem 1 (Electron. J. Combin. 2021): W(3,k) is at most exp(C k^(1-c)) for absolute constants C, c > 0, the first bound of the shape Erdős asked for; refereed, credited by the site's curator.
2021_02_02_green: Green's Theorem 1.1 (Forum of Mathematics, Pi 2022): W(3,k) is at least k to the power c (log k / log log k)^(1/3), the first superpolynomial lower bound, refuting the quadratic conjecture of Ahmed, Kullmann and Snevily; refereed.
2021_11_01_hunter: Hunter's Theorem 1 (Combinatorica 2022): W(3,k) is at least k to the power c log k / log log k, improving Green's bound; the sources expect W(3,k) at most k^(O(log k)); refereed, credited by the site's curator.