Erdős Problem #716
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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
Let F denote ALL configurations of three distinct 3-uniform hyperedges on at most six vertices. The Brown–Erdős–Sós (6,3) question asks whether any n-vertex 3-uniform hypergraph avoiding F has \(o(n^2)\) hyperedges, i.e. \(\mathrm{ex}_3(n,F)=o(n^2)\). The answer is YES by the classical Ruzsa–Szemerédi theorem, while later generalizations are distinct. The source describes 'on six vertices', which may include isolated vertices; the intended property is that no three edges span at most six vertices.
A small example
Three triples {1,2,3}, {3,4,5}, {1,4,6} use exactly six vertices, so a 3-uniform hypergraph containing these edges violates the (6,3)-free condition. Two disjoint triples on six vertices are allowed (the condition forbids configurations of THREE edges), illustrating the number-of-edges quantifier.
What is known
Brown, Erdős and Sós [BES73] conjectured the (6,3) density bound and Ruzsa–Szemerédi [RuSz78] proved it, classically linked to the triangle removal lemma and induced matchings. The maintained #716 currently reports an external LEAN proof (pinned file metadata 2026-06-21), but GCL's protected FC-GDM-85F86371 snapshot contains no admitted #716 file. This external status cannot be certified by GCL without exact theorem target, dependencies and kernel replay. The asymptotic n² density bound is not a claim of a particular explicit optimal error term.
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: proved ruzsa szemeredi six three; external lean gcl not replayed. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
ERDOS-716-SIX_THREE-REMOVAL-INTERFACE. Prove an exact finite equivalence between 'no 3 edges have union size≤6' and exclusion of the six-vertex forbidden family; inspect Ruzsa–Szemerédi original theorem / triangle removal reduction. Audit the external Lean certificate only with pinned theorem statement and complete axioms.
Sources and claim boundaries
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: #1987 — 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.