Minimal enumerations of subsets of a finite set and the middle level problem ?
A well-known problem of the existence of a Hamilton cycle in the middle two levels of the n-dimensional Boolean lattice, n is odd, is considered. The necessary and sufficient conditions for an n-symbol sequence to be a code of the cycle are obtained. It is shown that symbols of the sequence must satisfy certain properties of an uniform distribution in the sequence.
middle level problem hamilton cycle