I have a set [math]T[/math] with [math]n[/math] elements. And I want a maximal family [math]A_1,...,A_k[/math] of subsets of [math]T[/math] such that [math]|A_i|=m[/math] and [math]|A_i\cup A_j|=r[/math]. How can I calculate k given n, m and r?
valid question