Hamiltonian cycles and symmetric chains in Boolean lattices.

DOI10.1007/s00373-013-1350-8zbMath1315.06004OpenAlexW2111372012MaRDI QIDQ489325

Noah Streib, William T. jun. Trotter

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1350-8

zbMATH Keywords

Hamiltonian cyclesCartesian productsBoolean latticescover graphssubset latticessymmetric chain decompositions

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Chain conditions, complete algebras (06E10)

Related Items (5)

Unnamed Item ⋮ On the central levels problem ⋮ Incidence posets and cover graphs ⋮ Gray codes and symmetric chains ⋮ On orthogonal symmetric chain decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in the middle two layers of the discrete cube
• Dimension preserving contractions and a finite list of 3-irreducible posets
• Strong versions of Sperner's theorem
• Venn diagrams and symmetric chain decompositions in the Boolean lattice
• Monotone Gray codes and the middle levels problem
• Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
• A Survey of Combinatorial Gray Codes

This page was built for publication: Hamiltonian cycles and symmetric chains in Boolean lattices.