Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

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

Michel Mollard

Résumé

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].
Fichier principal
Vignette du fichier
proof of the conjecture.pdf (66.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01324319 , version 1 (31-05-2016)
hal-01324319 , version 2 (18-10-2016)

Identifiants

Citer

Michel Mollard. Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes. 2016. ⟨hal-01324319v1⟩
67 Consultations
96 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More