Extremal problems on set systems
Random Structures & Algorithms
A Note on a Question of Erdös and Graham
Combinatorics, Probability and Computing
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
| Hi-index | 0.00 |
We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.