Erdős Problem #837
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: graph theory, hypergraphs.
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
Some hypergraph edge-density thresholds force a substantial density improvement in a growing subgraph. Graph thresholds are classical, but determining the three-uniform hypergraph density-jump thresholds is an open extremal problem.
Let \(A_k\) be the set of threshold densities alpha in [0,1] with a positive DENSITY JUMP: for any sequence of growing k-uniform hypergraphs whose normalized edge density has liminf >alpha, there exist subhypergraphs on vertex orders tending to infinity with liminf density exceeding some beta>alpha; additionally the implication need not remain true on replacing >alpha by >=alpha. Determine \(A_3\). Do not confuse asymptotic density with a single finite graph.
A small example
The balanced complete bipartite \(K_{3,3}\) has 9 edges on 6 vertices and density \(9/\binom{6}{2}=3/5\); a sequence \(K_{m,m}\) has density \(m^2/\binom{2m}{2}=m/(2m-1)\to1/2\). This illustrates graph-Turán threshold 1/2 (j=2), NOT a 3-uniform theorem.
This finite calculation is not an asymptotic or all-parameter proof.
What is known
Maintained /latex/837 read 2026-10-14. For ordinary graphs (uniformity 2), \(A_2=\{1-1/j:j\ge1\}\), the Turán density thresholds. No classification of \(A_3\) is provided; overall OPEN. Source originally attributed to Erdős–Simonovits. Full historical proof not independently read. Exact equality case is a necessary part of definition.
For an s-uniform hypergraph, normalize the edge density as
An alpha jump asks for a beta>alpha working uniformly across qualifying sequences of graphs with growing subgraphs, and requires checking the non-strict equality threshold separately. The known graph jump set is \(A_2=\{1-1/j:j\geq1\}\). That does not classify \(A_3\).
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: open three uniform density jump set a3. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Compute density \(K_{m,m}\) for m=3,4,8 and asymptotic limit. Source lock exact beta quantified scope and k3 known partial jump values before any assertion about A3.
The original primary mathematical proofs, quantified status, finite definitions and deployed rendering must be independently checked before protected admission. No such admission is claimed here.
Sources and claim boundaries
- Maintained Erdős problem #837, LaTeX/bibliography and authenticated issue source return, checked 14 October 2026.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. Original papers and unresolved proof obligations are identified in the source comment.
- Critical review: PENDING. Protected publication: NONE. Deployed 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: #2108 — 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.