Kneser's theorem (combinatorics)

Kneser's theorem is a result in combinatorial topology and algebraic topology that deals with the intersection properties of certain families of subsets of a finite set. Specifically, it provides a bound on the size of families of subsets that can be chosen from a finite set, under the constraint that certain intersections are empty.