Erdős Problem #808 — Sums and products along a dense graph
Statement
For every , is there an such that whenever , is an -element set of integers, and is a graph on with at least edges, one has where the two sets contain the sums and products along the edges of ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.