on the cayleyness of bipartite kneser graphs

Abstract. for any given n, k ∈n with 2k < n, the bipartite kneser graph h(n, k) is defined as the graph whose vertex set is the family of k-subsets and (n − k)-subsets of [n] = {1, 2, . . . ,n} in which any two vertices are adjacent if and only if one of them is a subset of the other. in this paper, we study some algebraic properties of the bipartite kneser graph h(n, k). in particular, we determine the values of n, k for which the bipartite kneser graph h(n, k) is a cayley graph.