New upper bound for sums of dilates

zbMath1407.11118arXiv1607.04888MaRDI QIDQ2401423

Albert Bush, Yi Zhao

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.04888

zbMATH Keywords

sumsetsgraph decompositiondilatesbiclique partitionPlünnecke-Ruzsa inequality

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (1)

A question of Bukh on sums of dilates

Cites Work

• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• New proofs of Plünnecke-type estimates for product sets in groups
• ADDITIVE DIMENSION AND A THEOREM OF SANDERS
• Sums of Dilates
• Eine zahlentheoretische Anwendung der Graphentheorie.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New upper bound for sums of dilates