logo
Published on Department of Mathematics (http://www.math.ohio-state.edu)

An upper bound for K-intersecting families

By admin
Created Apr 12 2006 - 2:11pm
Oct 10 2002 - 2:30pm
Niranjan Balachandran
<Other>
MA417
Let K be a subset of k positive integers. By a K-intersecting family F, we mean a family of subsets of S={1,2,...,n} such that for any A,B in the family F,|A(intersect)B| is an element of K. The purpose of the talk is to present a result due to Snevily: for such a family F, |F|< = the sum of the binomial coeffs (n-1)Ci,i ranging from 0 to k. This generalizes an earlier proved result for the set K={1,2,...k}.

Source URL:
http://www.math.ohio-state.edu/node/22472