Skip to content

Erdős Problem #808

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: additive combinatorics, graph theory.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

For n-element set A of POSITIVE integers and graph G on A with at least n^(1+c) edges, define graph-restricted sumset A+_G A={a+b: {a,b} edge of G} and product set A*_G A similarly. The strong conjecture for every c,epsilon>0 demanded max cardinality >= n^(1+c-epsilon) for all sufficiently large n.

The graph-restricted sum/product conjecture does not inherit the truth status of the familiar unrestricted sum-product question. A dense chosen edge set may create comparatively few distinct sums and products. The published counterexample explicitly exploits this restriction, while a different, weaker universal lower bound remains valid.

A small example

For A={1,2,3,4} and G with edges {1,2}, {1,3}, {2,4}, the graph-restricted sums are {3,4,6} and products {2,3,8}; both have size three, while the full unrestricted A+A and A*A may be larger. Graph edges are UNORDERED distinct pairs.

This finite fixture tests the conventions. It does not certify any of the asymptotic or all-graphs assertions.

What is known

Maintained #808 DISPROVED by Alon–Ruzsa–Solymosi [ARS20], Sums, products, and ratios along the edges of a graph (Publ. Mat. 2020): constructs graphs with >=n^(5/3-o(1)) edges but graph-sum and graph-product counts O(n^(4/3+o(1))). They separately prove lower max(|sums|,|products|) >=constant m^(3/2) n^(-7/4) for m edges. This does not disprove ordinary unrestricted sum-product question #52, and original ARS20 full proof not reproduced.

The distinctions between established partial theorems, original open parts, and disproved universal claims have been preserved. Historical publications are attributed, rather than presented as new GCL mathematics.

The positive theorem cited alongside the counterexample is, writing \(m=|E(G)|\),

\[ \max\bigl(|A+_GA|,\ |A\cdot_GA|\bigr) \gg m^{3/2}n^{-7/4}. \]

The stronger proposed exponent \(1+c-\varepsilon\) is false for graph-restricted sums and products. The theorem about the unrestricted sets \(A+A\) and \(A\cdot A\) is a separate problem.

GCL's current state

The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.

Unclosed mathematical proof/source qualifications: ALON_RUZSA_SOLYMOSI2020_FULL_PROOF_PENDING; RESTRICTED_VS_UNRESTRICTED.

What remains

Implement exact restricted sum/product sets for small graph and compare full sets; check 2020 paper's exponent arguments including c choice near 2/3, o(1) and epsilon positive; preserve distinction restricted versus unrestricted.

For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.

Sources and claim boundaries

  • Erdos problem #808 and maintained source and bibliography, retrieved by web search 14 October 2026.
  • Authenticated issue-bound return for #808, preserving source limitations and open proof obligations.
  • Pinned teorth/erdosproblems repository revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, source blob 4e60263a80af6207aca494d2e1388e44fa372889. No protected source lock was silently changed.
  • Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2079 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction