Return to Revisions

3 of 3

added 46 characters in body

edited Jul 31, 2011 at 17:34

Number of closed walks on an $n$-cube

Is there a known formula for the number of closed walks of length (exactly) $r$ on the $n$-cube? If not, what are the best known upper and lower bounds?

[Edit] Note: the walk can repeat vertices.

co.combinatorics graph-theory

asked Jul 31, 2011 at 16:42

Lev Reyzin