https://hackerpaper.kaipfister.de/p/1104.0642/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=22679318urn:hackerpapers:mention:1104.0642:22679318Tue, 24 Mar 2020 21:40:06 GMT<p>I, uh, wasted a bit of time once on the Tree Packing conjecture of Gyarfas: https://arxiv.org/abs/1104.0642 In your left hand, place a complete graph, which has n-choose-2 edges. In your right hand, a collection of trees on 2, 3, 4, ..., n-1 vertices, which, by miraculous concidence, also has n-choose-2 edges. Q: Can you pack the trees into a complete graph with no overlapping edges?</p><p><a href="https://hackerpaper.kaipfister.de/p/1104.0642/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO