[danbruc]

The edges of complete graphs with 2n + 1 vertices can be covered with the edges of 2n + 1 identical copies of any tree with n + 1 vertices.