Erdős Problem #1178
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1178 asks the following. The maintained status is OPEN.
For \(r,e\ge3\) let \(\mathcal F_{r,d,e}\) consist of all \(r\)‑uniform hypergraphs with \(d\) vertices and \(e\) edges. Let \(d_r(e)\) be the least \(d\) with \(\mathrm{ex}_r(n,\mathcal F_{r,d,e})=o(n^2)\). Brown–Erdős–Sós conjecture
The \(o(n^2)\) is an asymptotic bound on extremal edge count, not a finite exact identity. The family forbids \(e\) edges supported on at most \(d\) vertices, subject to the source's isolated-vertex convention.
A small example
At \((r,e,d)=(3,3,6)\), a universe of \(n=4,5,6\) vertices has the property that any three distinct triples are supported on at most six vertices. Thus it can have at most two triples while avoiding \(\mathcal F_{3,6,3}\); two triples are allowed. Hence \(\mathrm{ex}_3(n,\mathcal F)=2\) for those three finite sizes. This does not prove a limit as \(n\to\infty\).
What is known
The general problem remains OPEN at https://www.erdosproblems.com/1178. BES73 showed \(d_r(e)\ge(r-2)e+3\); Ruzsa–Szemerédi [RuSz78] proved \(d_3(3)=6\), and Erdős–Frankl–Rödl [EFR86] resolved \(d_r(3)\) for all \(r\ge3\). Sárközy–Selkow [SaSe05] proved upper \((r-2)e+2+\lfloor\log_2e\rfloor\). Conlon–Gishboliner–Levanzov–Shapira [CGLS23] obtained \(d_3(e)\le e+O(\log e/\log\log e)\). None solves all \((r,e)\).
GCL's current state
Authenticated original-issue RESULT/1 research return. GCL independently replayed only the exact bounded fixture in ci/erdos_compendium_007_phase21_checks.py. The general theorem statements above are attributed to their external sources rather than independently certified. This is a locally authored and unaccepted draft.
What remains
Read BES73 and EFR86 for exact forbidden-family embeddings, independent proof-review of the \(e=3\) case and subsequent CGLS23 upper bound, and compare with #1157's more general extremal formulation. Do not promote finite examples to asymptotics.
Protected V2 admission requires source fidelity, manuscript QA and any mandatory independent critic reviews; none is inferred from this finite example.
Sources and claim boundaries
https://www.erdosproblems.com/1178 ; [BES73],[Er75b],[RuSz78],[EFR86],[SaSe05],[CGLS23], #1157.
Finite evidence receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE21.json. Original GitHub source issue identities unchanged; source-fidelity adjudication, public deployment and V2 editorial acceptance PENDING.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2449 — 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.