Let C (n; q) denote the graph whose vertices are the subspaces of the n dimensional vector space V over GF (q) and whose edges are the pairs fX; Y g where X Y = V. We show that C (n; q) has a perfect matching if and only if q is odd or n is odd. If q and n are even and q > 2 we show there exist matchings which omit only one vertex.