MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

let $A=\{1,2,3...,N\}$ and $B_1,B_2,B_3\dots,B_n$ be a series of subsets of $A$ which satisfied that $|B_i|=m$, $|B_i\cap B_j|\le k$. what is the maximum of $n$? ($k< m< N$)

it can be easily showed that $n\le [C(N−1,k)/C(m−1,k)]/[N/m]$ (by counting twice, $[X]$ is integer part of $x$)

I wonder is there any reserch that tackle this problem? Do we have some profound result?

share|cite|improve this question
up vote 1 down vote accepted

Yes, this is an active research area. For a quick survey, see the introduction to this paper of Furedi and Sudakov. (they also prove many interesting extensions).

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.