Kneser graphs are Hamiltonian

Arturo Merino, Torsten Mütze, Namrata

For integers $k\ge 1$ and $n\ge 2k+1$, the Kneser graph $K(n,k)$ has as vertices all $k$-element subsets of an $n$-element ground set, and an edge between any two disjoint sets.…