OurBigBook About$ Donate
 Sign in Sign up

Graph form of the Balog-Szemerédi-Gowers theorem

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Additive combinatorics Additive energy Balog-Szemerédi-Gowers theorem
2026-10-07  0 By others on same topic  0 Discussions Create my own version
There are absolute c,C>0 such that finite sets A,B of size n, a bipartite graph of density at least δ, and a restricted sumset of size at most Kn yield subsets A′,B′ with ∣A′∣,∣B′∣≥cδCn and ∣A′+B′∣≤Cδ−CKCn. A graph formed by popular representations of sums turns this into the usual large-additive energy form of the Balog-Szemerédi-Gowers theorem.

 Ancestors (7)

  1. Balog-Szemerédi-Gowers theorem
  2. Additive energy
  3. Additive combinatorics
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 11 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook