Explicit matchings in the middle levels of the Boolean lattice

Henry Kierstead, W. T. Trotter

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

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
JournalOrder
Volume5
Issue number2
DOIs
StatePublished - Jun 1988

Fingerprint

Boolean algebra
Boolean Lattice
Hamiltonians
Bipartite Graph
Class

Keywords

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

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Explicit matchings in the middle levels of the Boolean lattice. / Kierstead, Henry; Trotter, W. T.

In: Order, Vol. 5, No. 2, 06.1988, p. 163-171.

Research output: Contribution to journalArticle

Kierstead, Henry ; Trotter, W. T. / Explicit matchings in the middle levels of the Boolean lattice. In: Order. 1988 ; Vol. 5, No. 2. pp. 163-171.
@article{a591ae87a0bf4f12a1bf6c3f23dfb172,
title = "Explicit matchings in the middle levels of the Boolean lattice",
abstract = "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.",
keywords = "AMS subject classifications (1980): 05C45, 05C70, 06A10, Boolean lattice, Hamiltonian cycle, matching",
author = "Henry Kierstead and Trotter, {W. T.}",
year = "1988",
month = "6",
doi = "10.1007/BF00337621",
language = "English (US)",
volume = "5",
pages = "163--171",
journal = "Order",
issn = "0167-8094",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Explicit matchings in the middle levels of the Boolean lattice

AU - Kierstead, Henry

AU - Trotter, W. T.

PY - 1988/6

Y1 - 1988/6

N2 - 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.

AB - 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.

KW - AMS subject classifications (1980): 05C45, 05C70, 06A10

KW - Boolean lattice

KW - Hamiltonian cycle

KW - matching

UR - http://www.scopus.com/inward/record.url?scp=0041069941&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041069941&partnerID=8YFLogxK

U2 - 10.1007/BF00337621

DO - 10.1007/BF00337621

M3 - Article

AN - SCOPUS:0041069941

VL - 5

SP - 163

EP - 171

JO - Order

JF - Order

SN - 0167-8094

IS - 2

ER -