On a question of Erdős and Moser

By Benny Sudakov, Endre Szemerédi, Van H. Vu. 2005

56 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/7d8f028852883bbc7678d7e02af629a7e772a782

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Tomasz Schoen
2. Ilya D. Shkredov
3. Tom Sanders

In Discrete Mathematics and Combinatorics

1. Tomasz Schoen
2. Ilya D. Shkredov
3. Tom Sanders

Citations in the corpus

• Near optimal bounds in Freiman's theorem (2011, background): “Freiman’s theorem have a plethora of deep applications to many important problems as the recent one from the papers of Gowers [12], [13] who used it to get an effective version of Szemerédi’s theorem (for further papers which make an important use of Freiman’s result see for example [4], [6],[26], [”