  In this paper, we obtain a combinatorial formula for computing the Betti
numbers in the linear strand of edge ideals of bipartite Kneser graphs. We
deduce lower and upper bounds for regularity of powers of edge ideals of these
graphs in terms of associated combinatorial data and show that the lower bound
is attained in some cases. Also, we obtain bounds on the projective dimension
of edge ideals of these graphs in terms of combinatorial data.
