Order

, Volume 26, Issue 2, pp 101–107

# The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice

Article

## Abstract

Consider the lattice whose elements are the subsets of the set of positive integers not greater than n ordered by inclusion. The Hasse diagram of this lattice is isomorphic to the n-dimensional hypercube. It is trivial that this graph is Hamiltonian. Let $$\{S_1,\ldots,S_{2^n}\}$$ be a Hamiltonian path. We say it is monotone, if for every i, either (a) all subsets of Si appear among S1,...,Si − 1, or (b) only one (say S) does not, furthermore Si + 1 = S. Trotter conjectured that if n is sufficiently large, then there are no monotone Hamiltonian paths in the n-cube. He also made a stronger conjecture that states that there is no path with the monotone property that covers all the sets of size at most three. In this paper we disprove this strong conjecture by explicitly constructing a monotone path covering all the 3-sets.

### Keywords

Hamiltonian path Boolean lattice Gray code

## Preview

### References

1. 1.
Bollobás, B.: Modern Graph Theory. Springer, New York (2002)Google Scholar
2. 2.
Felsner, S., Trotter, W.T.: Colorings of diagrams of interval orders and α-sequences of sets. Discrete Math. 144(1–3), 23–31 (1995). Combinatorics of ordered sets (Oberwolfach, 1991)
3. 3.
Johnson, R.J.: Long cycles in the middle two layers of the discrete cube. J. Comb. Theory Ser. A 105(2), 255–271 (2004)
4. 4.
Trotter, W.T.: Combinatorics and Partially Ordered Sets. The Johns Hopkins University Press, Baltimore (1992)