Forbidden configurations: Induction and linear algebra

Let a matrix be called simple if it is a (0, 1)-matrix with no repeated columns. We consider results of the form: if A is an m × n simple matrix with no submatrix which is a column permutation of F for all F in some specified set of matrices F, then n ≤ f(m). We obtain some results using induction and some results using linear algebra.