论文信息 - Explicit matchings in the middle levels of the Boolean lattice

Explicit matchings in the middle levels of the Boolean lattice

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

William T. Trotter | Henry Kierstead | H. Kierstead | W. T. Trotter

[1] Dwight Duffus,et al. Lexicographic matchings cannot form Hamiltonian cycles , 1988 .

[2] Charles H. C. Little,et al. On defect-d matchings in graphs , 1975, Discret. Math..

[3] T. V. Narayana. Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 , 1979 .

[4] T. V. Narayana,et al. Lattice Path Combinatorics With Statistical Applications , 1979 .