It is open. Best current results in the quantitative version of Roth's theorem belong to Sanders and allow to find 3-term arithmetic progression between something like $O(n/\log^{1-\varepsilon} n)$ numbers not exceeding $n$, for any given $\varepsilon>0$.
Fedor Petrov
- 116.2k
- 9
- 286
- 508