Minimal enumerations of subsets of a finite set and the middle level problem

DOI10.1016/S0166-218X(00)00363-2zbMath0996.05003OpenAlexW2031520807MaRDI QIDQ5954085

A. A. Evdokimov, A. L. Perezhogin

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00363-2

zbMATH Keywords

Hamilton cyclemiddle level problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Lexicographic matchings cannot form Hamiltonian cycles
• Explicit matchings in the middle levels of the Boolean lattice
• Monotone Gray codes and the middle levels problem
• Maximal length of circuit in a unitary \(n\)-dimensional cube
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal enumerations of subsets of a finite set and the middle level problem