Random d-regular graphs have sum-sets of size n^{1-2/d} for every abelian group, proving a polynomial lower bound that is tight up to polylog factors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sums along the edges of bounded degree graphs
Random d-regular graphs have sum-sets of size n^{1-2/d} for every abelian group, proving a polynomial lower bound that is tight up to polylog factors.