Sums, products, and ratios along the edges of a graph

From MaRDI portal
Publication:2302174




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.









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)