Note on the Theorem of Balog, Szemerédi, and Gowers
arXiv:2308.10245 · doi:10.1007/s00493-024-00092-5
Abstract
We prove that every additive set with energy has a subset of size such that . This is, essentially, the largest structured set one can get in the Balog-Szemerédi-Gowers theorem.
second version addresses referee reports