We construct recursive bounds on the minimal number of vertices whose removal from hypercube of dimension n leaves no subgraph isomorphic to Fibonacci cube of dimension m.