Explicit 2-factorizations of the odd graph
The Odd graph \(O_k\) is the special Kneser graph \(O_k=K(2k-1,k-1)\) of order \(2k-1\choose k-1\). The authors show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph. In particular, they use the lexical matchings and modular matchings to present explicit constructions of two different 2-factorisations of the Odd graph.
scientific article; zbMATH DE number 2138858
scientific article