Construction of 2-factors in the middle layer of the discrete cube

Torsten Mütze, Franziska Weber

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…