Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
Combinatorics
2016-10-19 v2
Abstract
The Fibonacci cube of dimension n, denoted as 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 n are covered by a maximum set of disjoint subgraphs isomorphic to Q k , answering an open problem proposed in [2].
Cite
@article{arxiv.1606.00138,
title = {Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes},
author = {Michel Mollard},
journal= {arXiv preprint arXiv:1606.00138},
year = {2016}
}