Recursive Relationships in the Classes of Odd Graphs and Middle Levels   Graphs
  The classes of odd graphs $O_n$ and middle levels graphs $B_n$ form one parameter subclasses of the Kneser graphs and bipartite Kneser graphs respectively. In particular both classes are vertex transitive while resisting definitive conclusions about their Hamiltonicity, and have thus come under scrutiny with regards to the Lov\'asz conjecture. In this paper, we will establish that middle levels graphs may always be embedded in odd graphs and middle levels graphs of higher degree, and furthermore, that this embedding allows us to define a recursion relationship in both classes which can be used to lift paths in $O_{n-1}$ (respectively $B_{n-1}$) to paths in $O_n$ (respectively $B_n$). This embedding also gives rise to the natural formation of a class of biregular graphs which give connections between the odd graphs, middle levels graphs and Catalan numbers. 
Timothy J. Frye
math.CO