Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes

From MaRDI portal
Publication:505451




Abstract: 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].









This page was built for publication: Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505451)