The Nine Dragon Tree Conjecture for bounded forest decompositions
Let be a graph, and let be nonnegative integers. The Nine Dragon Tree Conjecture. If
then decomposes into forests, one of which is -bounded. The conjecture is the graph-theoretic Nine Dragon Tree statement concerning decomposition into forests with one bounded component.
References
3 papers in this index state this conjecture (2016–2025). The statement above is taken from the most recent of them; the others are arXiv:2201.10791, arXiv:1608.05352.
Status
- Solved: Hongbi Jiang and Daqing Yang. Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True (Combinatorica, 2017) https://doi.org/10.1007/s00493-016-3390-1
Source: Hui Gao, “Packing spanning arborescences with extra large one”, arXiv:2511.18952 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.