Abstract
Let B(n) be the subset lattice of \({\{1,2,\dots, n\}.}\) Sperner’s theorem states that the width of B(n) is equal to the size of its biggest level. There have been several elegant proofs of this result, including an approach that shows that B(n) has a symmetric chain partition. Another famous result concerning B(n) is that its cover graph is hamiltonian. Motivated by these ideas and by the Middle Two Levels conjecture, we consider posets that have the Hamiltonian Cycle–Symmetric Chain Partition (HC-SCP) property. A poset of width w has this property if its cover graph has a hamiltonian cycle which parses into w symmetric chains. We show that the subset lattices have the HC-SCP property, and we obtain this result as a special case of a more general treatment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, I.: Combinatorics of Finite Sets. Oxfordshire, Oxford; Clarendon Press, New York (1987)
de Bruijn N.G., van Ebbenhorst Tengbergen C., Kruyswijk D.: On the set of divisors of a number. Nieuw Arch. Wisk 23(2), 191–193 (1952)
Engel K.: Sperner Theory. Cambridge University Press, New York (1997)
Felsner S., Trotter W.T.: Colorings of diagrams of interval orders and alpha-sequences of sets. Discret. Math. 144, 23–31 (1995)
Greene C., Kleitman D.J.: Strong versions of Sperner’s theorem. J. Combin. Theory Ser. A 20(1), 80–88 (1976)
Griggs J, Killian C., Savage C.: Venn diagrams and symmetric chain decompositions in the Boolean lattice. Electronic J. Combin. 11(R2), 30 (2004)
Johnson R.J.: Long cycles in the middle two layers of the discrete cube. J. Combin. Theory Ser. A 105(2), 255–271 (2004)
Katona G.O.H.: On a conjecture of Erdős and a stronger form of Sperner’s theorem. Studia Sci. Math. Hungar. 1, 59–63 (1966)
Kleitman D.J.: On a lemma of Littlewood and Offord on the distribution of certain sums. Math. Z. 90, 251–259 (1965)
Kleitman D.J.: On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors. Adv. Math. 5, 155–157 (1970)
Littlewood, J.E., Offord, A.C.: On the number of real roots of a random algebraic equation (III). , (1943)
Savage C.D.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605–629 (1997)
Savage C.D., Winkler P.: Monotone Gray codes and the middle levels problem. J. Combin. Theory Ser. A 70(2), 230–248 (1995)
Savage C.D., Shields I.: A Hamilton path heuristic with applications to the middle two levels problem. Congr. Numer. 140, 161–178 (1999)
Sperner E.: Ein Satz über Untermengen einer endlichen Menge. Math. Zeit 27, 544–548 (1928)
Streib, N.: Planar and Hamiltonian Cover Graphs. Ph.D. thesis, Georgia Institute of Technology (2012)
West, D.B.: Extremal Problems in partially ordered sets. In: Reidel, D.(ed.) Ordered Sets. (Proc. NATO ASI, Banff 1981, I. Rival), pp. 473–521 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Streib, N., Trotter, W.T. Hamiltonian Cycles and Symmetric Chains in Boolean Lattices. Graphs and Combinatorics 30, 1565–1586 (2014). https://doi.org/10.1007/s00373-013-1350-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1350-8