Tomáš Kaiser1
Let be the bipartite graph formed by the middle two levels of the
lattice of subsets of a
-element set. The well-known Middle levels
problem is the question whether
is hamiltonian for all
. As
a step towards an answer, we show that
has a spanning 3-connected
cubic subgraph.