论文信息 - An update on the middle levels problem

An update on the middle levels problem

The middle levels problem is to find a Hamilton cycle in the middle levels, M"2"k"+"1, of the Hasse diagram of B"2"k"+"1 (the partially-ordered set of subsets of a 2k+1-element set ordered by inclusion). Previously, the best known, from [I. Shields, C.D. Savage, A Hamilton path heuristic with applications to the middle two levels problem, in: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), vol. 140, 1999], was that M"2"k"+"1 is Hamiltonian for all positive k through k=15. In this note we announce that M"3"3 and M"3"5 have Hamilton cycles. The result was achieved by an algorithmic improvement that made it possible to find a Hamilton path in a reduced graph (of complementary necklace pairs) having 129,644,790 vertices, using a 64-bit personal computer.

Carla D. Savage | Ian Shields | Brendan J. Shields

[1] William T. Trotter,et al. Explicit matchings in the middle levels of the Boolean lattice , 1988 .

[2] Peter Winkler,et al. Monotone Gray Codes and the Middle Levels Problem , 1995, J. Comb. Theory, Ser. A.

[3] Carla D. Savage. Long Cycles in the Middle Two Levels of the Boolean Lattice , 1997 .

[4] Carla D. Savage,et al. Hamilton cycle heuristics in hard graphs , 2004 .

[5] Zdenek Ryjácek,et al. The Prism Over the Middle-levels Graph is Hamiltonian , 2005, Order.

[6] Glenn H. Hurlbert. The antipodal layers problem , 1994, Discret. Math..

[7] Stefan Felsner,et al. Colorings of diagrams of interval orders and alpha-sequences of sets , 1995, Discret. Math..

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

[9] ProblemIan ShieldsIBMP,et al. A Hamilton Path Heuristic with Applicationsto the Middle Two Levels , 1999 .

[10] Carla D. Savage,et al. A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem , 1999 .

[11] Italo J. Dejter. Hamilton cycles and quotients of bipartite graphs , 1985 .

[12] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..

[13] J. Robert Johnson,et al. Long cycles in the middle two layers of the discrete cube , 2004, J. Comb. Theory, Ser. A.

[14] László Babai. Long cycles in vertex-transitive graphs , 1979, J. Graph Theory.