Bourbaki marks this one as harder than the rest.
Let E be a finite set, let L and C be two disjoint non-empty subsets of P(E), and let λ,h,k,l be four integers ⩾1 with the following properties : (i) for each A∈L and each B∈C, Card(A∩B)⩾λ; (ii) for each A∈L, Card(A)⩾h; (iii) for each B∈C, Card(B)⩽k; (iv) for each x∈E, the number of elements of L∪C which contain x is exactly l. Show that Card(E)⩽hk/λ. (Let (ai)1⩽i⩽n be the sequence of distinct elements of E arranged in some order, and for each i let ri be the number of elements of L to which ai belongs. Show that, if Card(L)=s and Card(C)=t, then we have
i=1∑nri⩽sh,i=1∑n(l−ri)⩽tk,andi=1∑nri(l−ri)⩾λst.)
For Card(E) to be equal to hk/λ it is necessary and sufficient that for each A∈L and each B∈C we have Card(A)=h, Card(B)=k,
Card (A∩B)=λ, and that there exists an r⩽l such that for each x∈E the number of elements of L to which x belongs is equal to r.
Nothing.