Skip to content

Erdős Problem #743

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (not automatically the live result).
Subject areas: graph theory.

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

Given any collection of trees \(T_2\), ..., \(T_n\) with \(T_k\) having exactly k vertices, can the complete graph \(K_n\) have its edges partitioned into edge-disjoint embeddings of all the \(T_k\)? This is Gyárfás's tree packing conjecture, maintained FALSIFIABLE and OPEN. The edge count matches exactly, because \(\sum_{k=2}^n(k-1)=\binom{n}{2}\), but equality of counts alone never guarantees a packing.

A small example

For n=4, take \(T_4\) as the path 0–1–2–3 (3 edges), \(T_3\) as the star with edges {0–2,0–3} (2 edges), and \(T_2\) as the edge {1–3}. These are exactly the six edges of \(K_4\), pairwise edge-disjoint. A particular feasible tuple does not certify every collection of trees at any n.

What is known

Gyárfás–Lehel proved the all-stars/paths subcases, Fishburn checked n≤9, and Joos–Kim–Kühn–Osthus 2019 proved the bounded-maximum-degree variant. Allen et al. 2021 and Janzer–Montgomery 2024 advanced other restricted cases. An arXiv:2410.13840 preprint (Chalise–Clark–Gnang) CLAIMS a complete proof using a polynomial nonvanishing/composition lemma; the maintained site still marks the conjecture FALSIFIABLE and its forum labels the preprint claim, not an accepted proof. Without independent scrutiny of the composition lemma, do NOT mark the universal statement PROVED.

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: gyarfas tree packing falsifiable open; 2024 claimed preprint proof not independently certified. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

ERDOS-743-TREE_PACKING-COMPOSITION_GATE. Verify n=4 exact packing and check the purported 2024 composition lemma's proof and dependencies in the original preprint, plus independent referee reception. Acceptance is a checked exact counterexample or a fully audited theorem; reported preprint claim alone remains unaccepted.

Sources and claim boundaries

Maintained Erdős #743; original issue-bound GCL audit. Primary full proof pages not all inspected; no new independent primary theorem certification, real browser mathematics validation 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: #2014 — 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