Sums, products, and ratios along the edges of a graph
From MaRDI portal
Publication:2302174
DOI10.5565/PUBLMAT6412006zbMATH Open1465.11074arXiv1802.06405WikidataQ126564941 ScholiaQ126564941MaRDI QIDQ2302174FDOQ2302174
Authors: Noga Alon, József Solymosi, Imre Z. Ruzsa
Publication date: 25 February 2020
Published in: Publicacions Matemàtiques (Search for Journal in Brave)
Abstract: In their seminal paper ErdH{o}s and Szemer'edi formulated conjectures on the size of sumset and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph. In this paper we show that this strong form of the ErdH{o}s-Szemer'edi conjecture does not hold. We give upper and lower bounds on the cardinalities of sumsets, product sets and ratio sets along the edges of graphs.
Full work available at URL: https://arxiv.org/abs/1802.06405
Recommendations
- scientific article; zbMATH DE number 953250
- On multiple sum and product sets of finite sets of integers.
- Proof of the Erdős matching conjecture in a new range
- scientific article; zbMATH DE number 3330856
- On prime factors of sums of integers III
- The dimension of sums of graphs
- scientific article; zbMATH DE number 36206
- Sums and products along sparse graphs
- Bipartite subgraphs
- On sets free of sumsets with summands of prescribed size
Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Additive number theory; partitions (11P99)
Cited In (7)
- Sums and products along sparse graphs
- The Elekes-Szabó problem and the uniformity conjecture
- Constructions for the Elekes-Szabó and Elekes-Rónyai problems
- On sums and products along the edges, II
- Sums, products, and dilates on sparse graphs
- The multiplication table problem for bipartite graphs
- Improved bounds for pencils of lines
This page was built for publication: Sums, products, and ratios along the edges of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302174)