Explicit matchings in the middle levels of the Boolean lattice

Henry Kierstead; W. T. Trotter

doi:10.1007/BF00337621

Explicit matchings in the middle levels of the Boolean lattice

Henry Kierstead, W. T. Trotter

Research output: Contribution to journal › Article › peer-review

45 Scopus citations

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 language	English (US)
Pages (from-to)	163-171
Number of pages	9
Journal	Order
Volume	5
Issue number	2
DOIs	https://doi.org/10.1007/BF00337621
State	Published - Jun 1 1988

Keywords

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

Access to Document

10.1007/BF00337621

Cite this

@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 = jun,

day = "1",

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/1

Y1 - 1988/6/1

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

SN - 0167-8094

VL - 5

SP - 163

EP - 171

JO - Order

JF - Order

IS - 2

ER -

Explicit matchings in the middle levels of the Boolean lattice

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this