Problem

Source: Iran TST 2008

Tags: induction, combinatorics proposed, combinatorics



Suppose that $ T$ is a tree with $ k$ edges. Prove that the $ k$-dimensional cube can be partitioned to graphs isomorphic to $ T$.