The infinite Fibonacci cube and its generalizations
Abstract
The Fibonacci cube n is is the graph whose vertices are independent subsets of the path graph of length n, where two such vertices are considered adjacent if they differ by the addition or removal of a single element. Klavzar [1] suggested considering the infinite Fibonacci cube ∞ whose vertices are independent subsets of the one-way infinite path graph with the same adjacency condition. We show that every connected component of ∞ is asymmetric (has no nontrivial automorphism) and no two connected components of ∞ are isomorphic. This follows from our results on a further generalization G where G is a simple, locally finite hypergraph with no isolated vertices.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.