An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms (Q1106215)

An analogue of the Erdős-Ko-Rado theorem is proved for the distance- regular graphs \(H_ q(k,n)\) with \(k\times n\) matrices over GF(q) as vertex set and two matrices A and B adjacent if the rank of A-B is 1, where \(n\geq k+1\) and \((n,q)\neq (k+1,2)\). As an easy corollary, we prove that \(H_ q(k,n)\) has no perfect e-codes, \(e\geq 1\).