Article ID Journal Published Year Pages File Type
6424012 Electronic Notes in Discrete Mathematics 2011 4 Pages PDF
Abstract
Let T be a tree with m edges. We show that if T has at least (m+1)/3 leaves then T decomposes the complete bipartite graph K2n,2n. In particular this shows that almost all trees decompose K2n,2n, a result connected to a conjecture of Graham and Häggkvist.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Almost every tree with n edges decomposes K2n,2n
Authors
,