On a question of Erdős and Moser
From MaRDI portal
Publication:2566606
DOI10.1215/S0012-7094-04-12915-XzbMath1155.11346MaRDI QIDQ2566606
Endre Szemerédi, Van H. Vu, Benjamin Sudakov
Publication date: 26 September 2005
Published in: Duke Mathematical Journal (Search for Journal in Brave)
05D05: Extremal set theory
11B75: Other combinatorial number theory
11P70: Inverse problems of additive number theory, including sumsets
Related Items
On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs, Product set estimates for non-commutative groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Generalized arithmetical progressions and sumsets
- A statistical theorem of set addition
- A polynomial bound in Freiman's theorem.
- Finite and infinite arithmetic progressions in sumsets
- Sum-avoiding subsets
- On sets of integers containing k elements in arithmetic progression
- Probabilistic construction of small strongly sum-free sets via large Sidon sets
- On a Combinatorial Problem in Number Theory
- A new proof of Szemerédi's theorem