MathDB

3

Part of 2008 Iran Team Selection Test

Problems(1)

A tree with k edges

Source: Iran TST 2008

5/20/2008
Suppose that T T is a tree with k k edges. Prove that the k k-dimensional cube can be partitioned to graphs isomorphic to T T.
inductioncombinatorics proposedcombinatorics