balanced Incomplete Block Design, combinatorics Give an example of BIBD(balanced Incomplete Block Design) with no repeated blocks in which λ > k.
Here which I need to find a BIBD where λ(each pair of vertices occurs together in exactly λ blocks) is greater than k(each block contains k vertices). For example, (v,b,r,1,2).
any suggestions?

Take a set of size 6, and let the blocks be the subsets of size 3. I think you'll find this works with $\lambda=4$, $k=3$. 
