Corpus ID: 15975960

# Long Cycles in the Middle Two Levels of the Boolean Lattice

```@article{Savage1997LongCI,
title={Long Cycles in the Middle Two Levels of the Boolean Lattice},
author={Carla D. Savage},
journal={Ars Combinatoria},
year={1997}
}```
• C. Savage
• Published 1997
• Mathematics
• Ars Combinatoria
An intriguing open question is whether the graph formed by the middle two levels of the Boolean lattice of subsets of a k element set has a Hamilton path for all k We consider nding a lower bound on the length of the longest cycle in this graph A result of Babai for vertex transitive graphs gives a lower bound of N where N is the total number of vertices in the middle two levels In this paper we show how to construct a cycle of length N c where c
A short proof of the middle levels theorem
• Mathematics, Computer Science
• ArXiv
• 2017
A new proof of the well-known middle levels conjecture is presented, which is much shorter and more accessible than the original proof. Expand
On Hamilton cycles in highly symmetric graphs
Some of the recent results on Hamilton cycles in various families of highly symmetric graphs are surveyed, including the solution of the well-known middle levels conjecture, and several far-ranging generalizations of it that were proved subsequently. Expand
Proof of the middle levels conjecture
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length 2n + 1 that have exactly n or n + 1 entries equal to 1, with an edge between any two vertices forExpand
Proof of the middle levels conjecture
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length \$2n+1\$ that have exactly \$n\$ or \$n+1\$ entries equal to 1, with an edge between any two vertices forExpand
Hamilton cycle heuristics in hard graphs
• Mathematics
• 2004
In this thesis, we use computer methods to investigate Hamilton cycles and paths in several families of graphs where general results are incomplete, including Kneser graphs, cubic Cayley graphs andExpand
A Hamilton Path Heuristic with Applicationsto the Middle Two Levels
The notorious middle two levels problem is to nd a Hamilton cycle in the middle two levels, M 2k+1 , of the Hasse diagram of B 2k+1 (the partially ordered set of subsets of a 2k + 1-element setExpand
A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem
• Mathematics
• 1999
The notorious middle two levels problem is to nd a Hamilton cycle in the middle two levels, M2k+1, of the Hasse diagram ofB2k+1 (the partially ordered set of subsets of a 2k + 1-element set orderedExpand
Monotone Gray Codes and the Middle Levels Problem
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 1995
It is shown that for every ϵ > 0, there is an h ⩾ 1 so that if a hamilton cycle exists in the middle two levels of B 2k + 1 for 1 ⩽ k⩽ h, then there is a cycle of length at least (1 − ϵ) N(k) for all k ⩵ 1, where N( k)=2(2kk+1). Expand
Bipartite Kneser graphs are Hamiltonian
• Computer Science, Mathematics
• Electron. Notes Discret. Math.
• 2015
It is established the existence of long cycles in Kneser graphs (visiting almost all vertices), generalizing and improving upon previous results on this problem. Expand
An update on the middle levels problem
• Computer Science, Mathematics
• Discret. Math.
• 2009
The result was achieved by an algorithmic improvement that made it possible to find a Hamilton path in a reduced graph having 129,644,790 vertices, using a 64-bit personal computer. Expand