A quantitative improvement on the hypergraph Balog-Szemerédi-Gowers theorem
arXiv:2501.06131
Abstract
In this note, we obtain a quantitative improvement on the hypergraph variant of the Balog-Szemerédi-Gowers theorem due to Sudakov, Szemerédi, and Vu [Duke Math. J.129.1 (2005): 129--155]. Additionally, we prove the hypergraph variant of the ``almost all'' version of Balog-Szemerédi-Gowers theorem.
14 pages