Explicit matchings in the middle levels of the Boolean lattice

Henry Kierstead, W. T. Trotter

Research output: Contribution to journalArticlepeer-review

45 Scopus citations


New classes of explicit matchings for the bipartite graph ℬ(k) consisting of the middle two levels of the Boolean lattice on 2 k+1 elements are constructed and counted. This research is part of an ongoing effort to show that ℬ(k) is Hamiltonian.

Original languageEnglish (US)
Pages (from-to)163-171
Number of pages9
Issue number2
StatePublished - Jun 1 1988


  • AMS subject classifications (1980): 05C45, 05C70, 06A10
  • Boolean lattice
  • Hamiltonian cycle
  • matching

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Explicit matchings in the middle levels of the Boolean lattice'. Together they form a unique fingerprint.

Cite this