More odd graph theory from another point of view

The Kneser graph K(n,k) has as vertices all k-element subsets of [n]={1,2,…,n} and an edge between any two vertices that are disjoint. If n=2k+1, then K(n,k) is called an odd graph. Let n>4 and 14 is an even integer such that k is not of the form k=2t for some t>2, then the line graph of the odd graph Ok+1 is a vertex-transitive non Cayley graph.