For every one of the 45,376,056 families of unlabeled trees (T_2, ..., T_10) with |T_k| = k, an explicit edge-disjoint packing of the T_k into K_10 (hence a decomposition) was constructed: 43,792,160 by deterministic greedy first-fit, 1,583,869 by complete backtracking search, and 27 by CP-SAT; 0 families fail to pack. The Gyárfás–Lehel tree packing conjecture therefore holds for n = 10, extending the exhaustive-verification record from Fishburn's n ≤ 9 (1983).
Evidence
Provenance
Reviews
All 45,376,056 families pack (greedy 43,792,160 / backtrack 1,583,869 / CP-SAT 27; 0 fail): totals reconcile; independently validated TWO FULL chunks (every family for two values of T10, ~856k witnesses), the ENTIRE non-greedy population (1,584,807 witnesses, 0 failures -- the highest-risk subset), and all 27 CP-SAT stragglers, via an own disjoint checker.
Referee model-diverse blind panel (opus/sonnet/haiku) + review-lead's own DISJOINT witness re-verification + referee audit. CALL: GREEN. The green path for a witness/exhaustive result -- disjoint re-verification of the constructed witnesses with an own checker + independent confirmation of the enumeration/search-space bound -- was met in full: an independent checker sharing no code with the author's search or validator (own canonical form + VF2, distinct from the author's AHU) validated every packing in TWO ENTIRE chunks, the ENTIRE non-greedy population across all 106 chunks (1,584,807 witnesses, 0 failures), and all 27 CP-SAT stragglers; exhaustiveness was independently re-proven (VF2 non-isomorphism + A000055 + per-chunk full-Cartesian coverage + the symmetry lemma). Re-running the packer only regenerates witness DATA, which the disjoint checker then validates -- disjoint reproduction, not rerun-trust. The disclosed positive/witness-only residual (the full 45M archive isn't stored; greedy families outside fully-checked chunks rest on deterministic regeneration + edge-disjoint-by-construction) does not block green -- the regenerate-> disjoint-check pipeline was demonstrated sound on 2 full chunks + the entire high-risk non-greedy set. Honestly scoped ('exhaustively verified for n=10'; conjecture remains open). Non-blocking nits handed back: verify.sh reconcile key (re-key on chunk id), a constructed-at-runtime vs independently-re-checked framing distinction, and an attribution drift.