Name
Abstract | ||
|---|---|---|
For a binary word f, let Q"d(f) be the subgraph of the d-dimensional cube Q"d induced on the set of all words that do not contain f as a factor. Let G"n be the set of words f of length n that are good in the sense that Q"d(f) is isometric in Q"d for all d. It is proved that lim"n"-"~|G"n|/2^n exists. Estimates show that the limit is close to 0.08, that is, about eight percent of all words are good. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ejc.2011.10.001 | Eur. J. Comb. |
Keywords | Field | DocType |
fibonacci cube,length n,asymptotic number,d-dimensional cube,binary word | Discrete mathematics,Fibonacci cube,Combinatorics,Function composition,Isometric exercise,Mathematics,Binary number,Cube | Journal |
Volume | Issue | ISSN |
33 | 2 | 0195-6698 |
Citations | PageRank | References |
12 | 0.82 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sandi Klavar | 1 | 156 | 18.52 |
| S. Shpectorov | 2 | 82 | 15.28 |