Erdős Problem #734
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: 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
For all sufficiently large n, Erdős asks for a NONTRIVIAL pairwise balanced block design on n vertices, each vertex pair in exactly one block, with at most O(√n) blocks of EACH size t. This is OPEN. Big-O must be uniform over t and sufficiently large n. Define c_t=#blocks of size t.
A small example
In the seven-point Fano design, the seven blocks all have size three, so c₃=7 and \(\sum_t c_t\binom{t}{2}=7\cdot3=21=\binom{7}{2}\). This finite example cannot prove the asymptotic result. The design using all n choose 2 pairs as two-element blocks is a trivial linear space with \(c_2=\binom{n}{2}\), which fails the desired O(√n) frequency.
What is known
Pair counting gives the necessary identity \(\sum_t c_t\binom{t}{2}=\binom{n}{2}\). Its satisfaction alone does not construct an incidence design. The maintained source cites de Bruijn–Erdős's lower bound m≥n for nontrivial linear spaces, subject to its exact hypotheses, and quotes Erdős's unproved expectation from [Er81,p.35]. No general construction meeting the multiplicity bound is source-verified.
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: general nontrivial pairwise balanced design block size multiplicity open; finite fano example not all n. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Verify the pair-count identity and the exact Fano certificate, enumerate feasible size-frequency vectors for a small n, and source-lock the historic definition of 'nontrivial'. Construct one bounded design with unusually dispersed sizes or produce an explicit obstruction; do not extrapolate to all n.
Sources and claim boundaries
Maintained #734; GCL source report; Er81 historical proof context remains uninspected. No theorem, protected main publication or V2 admission.
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: #2005 — 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.