Skip to main content
Log in

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

  • Published:
Order Aims and scope Submit manuscript

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 S i appear among S 1,...,S i − 1, or (b) only one (say S) does not, furthermore S i + 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollobás, B.: Modern Graph Theory. Springer, New York (2002)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  4. Trotter, W.T.: Combinatorics and Partially Ordered Sets. The Johns Hopkins University Press, Baltimore (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Csaba Biró.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Biró, C., Howard, D.M. The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice. Order 26, 101–107 (2009). https://doi.org/10.1007/s11083-009-9107-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-009-9107-y

Keywords

Navigation