Conceptio › Archive › arXiv (All)
arXiv (All) open access

A Proof of the Tree Packing Conjecture

Chalise, Parikshit et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
05c70combinatoricsg-2-2
We prove a conjecture of Gyárfás (1976), which asserts that any family of trees $T_1, \dots, T_{n}$ where each $T_k$ has $k$ vertices packs into $K_n$. We do so by translating the decomposition problem into a labeling problem, namely complete labeling. Our proof employs the polynomial method using a
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 821673
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive