Erdős Problem #722
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (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 fixed integers k>r≥2, a Steiner system \(S(r,k,n)\) is a family of k-element blocks in an n-element set such that EVERY r-element subset belongs to exactly one block. Erdős asked whether, for all sufficiently large admissible n, such systems exist whenever \(\binom{k-i}{r-i}\) divides \(\binom{n-i}{r-i}\) for all i=0,…,r−1. The answer is PROVED by Peter Keevash; 'sufficiently large depending on k,r' is essential.
A small example
The Fano plane is \(S(2,3,7)\): take seven points indexed modulo 7 and lines {j,j+1,j+3} modulo 7, j=0,…,6. Every unordered pair of points occurs in exactly one of the seven triples. Parameters satisfy \(\binom{3}{2}\)=3 | \(\binom{7}{2}\)=21 and 2|6. This finite example is not Keevash's arbitrary-parameter existence proof.
What is known
Peter Keevash, 'The existence of designs', Keevash's primary preprint The existence of designs (arXiv:1401.3665, 2014) establishes general existence from admissibility for all sufficiently large n. The arXiv author abstract and Princeton's 2014 theorem announcement corroborate the large-n qualification; no journal volume is assigned here without bibliographic verification. Earlier Kirkman S(2,3), Hanani S(3,4), and Wilson S(2,k) special cases are distinct. Counting incidences proves the integrality/divisibility conditions necessary, but not sufficient without Keevash's deep theorem. The maintained catalogue #722 says PROVED; proof pages and assumptions not GCL-replayed.
GCL's current state
The authenticated original source return remains in its original BOUNDED_TASK_DESIGNED state. This is an editorially reviewed explanatory article in protected EC-BULK-005-R7, subject to that PR's protected merge. Original research theorem proofs and any external formalizations are attributed to their authors, not newly GCL-certified. The historical source and proof-review limitations recorded in the return remain applicable.
What remains
Source-lock Keevash's theorem statement and derive the necessary incidence divisibilities for each 0≤i<r by counting r-subsets containing a fixed i-subset; verify Fano \(S(2,3,7)\). Acceptance is exact bounded combinatorial proof plus original theorem reference and large-n quantifiers, not a new design existence proof.
Sources and claim boundaries
Maintained Erdős #722; GCL source report. Original historical theorem pages and full formal proof chain not independently inspected; no independent theorem proof certification.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1993 — 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.