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,\mathrm{.}\mathrm{.}\mathrm{.},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 $1< k < \frac{n}{2} $\mathrm{.}Inthepresentpaper,weshowthatiftheKnesergraph$K(n,k)$isofevenorderwhere$n$isanoddintegerorbothoftheintegers$n,k $ are even, then $K(n,k)$ is a vertex-transitive non Cayley graph. Although, these are special cases of Godsil [8], unlike his proof that uses some very deep group-theoretical facts, ours uses no heavy group-theoretic facts. We obtain our results by using some rather elementary facts of number theory and group theory. We show that “almost all” odd graphs are of even order, and consequently are vertex-transitive non Cayley graphs. Finally, we show that if $k>4$ is an even integer such that $k$ is not of the form $k=2^t$ for some $t>2$, then the line graph of the odd graph $O_{k+1}$ is a vertex-transitive non Cayley graph.