Skip to content

Erdős Problem #788

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

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

An adversary supplies a set of forbidden sums in an upper integer interval. We then select numbers in a lower interval, avoiding forbidden distinct-pair sums, and measure the worst-case total size of both sets.

Let f(n) be the greatest lower guarantee such that for EVERY B subset (2n,4n)∩N there exists C subset (n,2n)∩N with no sum c1+c2 in B for distinct c1,c2 in C, and |B|+|C|>= f(n). Thus f(n)=min_B (|B|+alpha(G_B)), where G_B is the graph on admissible middle integers with edge {c1,c2} whenever c1+c2 in B. The 'for every B' quantifier is ESSENTIAL; f(n) is not the maximum for a favorable choice of B.

A small example

For n=3 the eligible lower integers are 4,5, whose only distinct pair sum is 9. If 9 is forbidden we can select at most one; otherwise we can select both. The exact worst-case total is two.

Finite example n=3: middle integers (3,6)={4,5}, B ranges subsets of (6,12)={7,8,9,10,11}. Only distinct-pair sum is 4+5=9. If 9 in B then max |C|=1; otherwise |C|=2. The function of B can be enumerated exactly: min(|B|+alpha)=2 attained for B empty or {9}. No theorem about all n follows.

What is known

Maintained https://www.erdosproblems.com/788 OPEN. Records Choi [Ch71] O(n^{3/4}), Baltz–Schoen–Srivastav [BSS00] O((n log n)^{2/3}), and newer Alon–Pham [AlPh25] improvement f(n)<=n^{3/5+o(1)}, using random Cayley graph independence bounds; Hunter comment explains conditional exponent relationship. Desired n^{1/2+o(1)} still OPEN, catalogue also gives sqrt(n) lower construction. Source full papers and exact finite constants not independently checked.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: minimax b c graph reduction open. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Successor: write exhaustive finite graph-independent-set oracle for n<=7 (enumerating B then C), verify n=3 result; primary-source lock Alon–Pham [AlPh25] random Cayley reduction, including probability/range parameters.

Adversarial editorial checking must verify the original theorem hypotheses and examples and later inspect actual HTML/MathJax output. These prerequisites are not discharged by the existence of the draft.

Sources and claim boundaries

  • Maintained Erdős Problem #788 and authenticated source-return record.
  • Pinned teorth/erdosproblems source commit 536408716724a2402bdfa7c1d764bf83d64a8c89 at data/problems.yaml. Primary historical references are identified by their bibliography keys in the original return; any not directly inspected are explicitly unverified.
  • Source review: PARTIAL. Independent mathematical critical review: PENDING. Protected merge: NONE. Public browser MathJax: NOT VERIFIED. GCL theorem certification: NONE.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2059 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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