Skip to content

Erdős Problem #702

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

Let k≥4 and let F consist of k-element subsets of an n-element set. Erdős–Sós ask whether every family with MORE THAN \(\binom{n-2}{k-2}\) sets contains distinct A,B with \(|A\cap B|=1\). The maintained catalogue says PROVED. The threshold is strict, and all sets have equal cardinality k; it is not the classical intersecting-family EKR bound.

A small example

Fix any two coordinates {1,2}. All k-subsets containing both form a family with exactly \(\binom{n-2}{k-2}\) members, and every two sets meet in at least those two coordinates. Thus the stated threshold cannot be lowered for n≥k≥4. For n=6,k=4 the family has \(\binom{4}{2}\)=6 members and no intersection of size one.

What is known

Peter Frankl, 'On families of finite sets no two of which intersect in a singleton', Bulletin of the Australian Mathematical Society 17 (1977), 125–134, DOI 10.1017/S0004972700025521, is a PRIMARY publisher-level source. Its ABSTRACT says the Erdős–Sós conjecture holds when n>n0(k), not explicitly for every n. The maintained catalogue attributes the FULL n statement to Frankl [Fr77], and Katona earlier established k=4. Source-fidelity qualification: without the complete theorem pages or a separate small-n argument, the abstract proves only the large-n range. Do not silently remove its n>n0(k) hypothesis. No pinned admitted FC statement exists.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition PARTIAL. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.

Source interpretation and unresolved mathematical qualification: Frankl's publisher abstract guarantees sufficiently large n; full all-n catalogue assertion requires original theorem and small-n checking.

The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.

What remains

Inspect Frankl 1977 full statement and historical Erdős pages; determine whether small-n cases are covered by additional lemmas or separate proof. Formalize the exact double-star threshold and an n=6,k=4 extremal witness. Admission requires a source-grounded all-n theorem statement or explicit caveat.

Sources and claim boundaries

Maintained Erdős #702, https://www.erdosproblems.com/702 ; https://doi.org/10.1017/S0004972700025521 ; [Er75f,p.108],[Er76b,p.186] originals uninspected. Authenticated source-return evidence. Historical full proofs not independently replayed. no newly certified theorem proof, public mathematics rendering or V2 admission.

Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1973 — 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.

Back to catalogue · Compendium introduction