Linked from

The 14 pages that link to Additive combinatorics, each with the reason it gives.

• Incidence geometryRelated: Geometric incidence estimates can bound additive structures through point-line transformations.

• IncidenceRelated: Incidence bounds can control solutions to equations involving sums and products.

• Additive number theoryNarrower topic: This broader framework supplies many modern tools for studying sums of integers.

• Terence TaoNarrower topic: This field connects Tao’s work on arithmetic progressions with analytic number theory.

• Green–Tao theoremNarrower topic: Green–Tao exemplifies how additive-combinatorial structure can reveal patterns in primes.

• Van der Waerden's theoremNarrower topic: The theorem is an early model of structure forced by colorings rather than density.

• Endre SzemerédiRelated: Szemerédi’s progression results helped shape this field’s central questions.

• Szemerédi–Trotter theoremNarrower topic: The theorem supplies geometric estimates used in several additive-combinatorial arguments.

• Steinhaus theoremNarrower topic: The theorem guarantees local additive structure in every positive-measure set.

• Szemerédi's theoremNarrower topic: Szemerédi's theorem is a landmark result in this broader study of additive patterns.

• Algebraic combinatoricsRelated: It shares algebraic settings but focuses especially on additive structure and density.

• Cameron–Erdős conjectureRelated: The conjecture is a counting problem about sets constrained by addition.

• Erdős–Graham problemRelated: The problem asks whether abundant reciprocal weight forces a particular finite additive pattern.

• Erdős–Szemerédi theoremNarrower topic: The theorem helped motivate a broader framework for comparing additive and multiplicative structure.