In their seminal paper Erdős and Szemerédi 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 Erdős-Szemerédi 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.
The first named author is supported in part by NSF grant DMS-1855464, ISF grant 281/17, and the Simons Foundation. The second named author is supported in part by an OTKA NK 104183 grant. The third named author is supported in part by a NSERC and an OTKA NK 104183 grant.
"Sums, products, and ratios along the edges of a graph." Publ. Mat. 64 (1) 143 - 155, 2020. https://doi.org/10.5565/PUBLMAT6412006