  The Fibonacci cube of dimension n, denoted as $\Gamma$ n , is the subgraph of
n-cube Q n induced by vertices with no consecutive 1's. In this short note we
prove that asymptotically all vertices of $\Gamma$ n are covered by a maximum
set of disjoint subgraphs isomorphic to Q k , answering an open problem
proposed in [2].
