Bipartite Kneser graphs are Hamiltonian

Torsten Mütze, Pascal Su

For integers $k\ge 1$ and $n\ge 2k+1$ the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\dots ,n\}$ and an edge between any two vertices (=sets) th…