MathDB
A tree with k edges

Source: Iran TST 2008

May 20, 2008
inductioncombinatorics proposedcombinatorics

Problem Statement

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.
Back to ProblemsView on AoPS