Combinatorial solution of certain systems of linear equations involving (0,1) matrices
W. E. Longstaff · Journal of the Australian Mathematical Society · 1977
Abstract If m and n are natural numbers satisfying 1 ≦ m < n let denote the least integer k such that the statement: ‘Every (0,1) matrix with n columns, with constant row-sum m, and with at least k distinct rows, has rank n’ is true. Then = +1 for m ≧ 2, n ≧ m2 + 2. Further, for 1 ≦ m < n.