A quantitative improvement on the hypergraph Balog-Szemer\'edi-Gowers theorem
Abstract
In this note, we obtain a quantitative improvement on the hypergraph variant of the Balog-Szemer\'edi-Gowers theorem due to Sudakov, Szemer\'edi, and Vu [Duke Math. J.129.1 (2005): 129--155]. Additionally, we prove the hypergraph variant of the ``almost all'' version of Balog-Szemer\'edi-Gowers theorem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.