olymmath

IR-TST 2008 Problem 3

    Suppose that TT is a tree with kk edges. Prove that the kk -dimensional cube can be partitioned to graphs isomorphic to TT .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ir-tst/2008/p3 · Tag WTXH18NSVW · Edit this page on GitHub · Keys: j next, k previous