In this talk, we show the cutoff phenomenon for simple random walks on Kneser graphs. Given two integers n and k, the Kneser graph K(2n+k,n) is defined as the graph with vertex set being all subsets of {1,...,2n+k} of size n and two vertices A and B being connected by an edge if A∩B = ∅. We show that if k = O(n), then the random walk on K(2n+k,n) exhibits a cutoff at 1/2log_{1+k/n}(2n+k) with a window of size O(n/k).