t-Designs with the number of blocks close to the Fisher type lower bound

It is shown that, for any given pair of positive integers e and c, there are only finitely many non-trivial 2e- ( v , k , λ ) designs where the number of blocks b is equal to ( v e ) + c .