MathDB
Erdos-Ko-Rado generalization

Source: Iranian National Olympiad (3rd Round) 2006

September 11, 2006
combinatorics proposedcombinatorics

Problem Statement

Let DD be a family of ss-element subsets of {1.,n}\{1.\ldots,n\} such that every kk members of DD have non-empty intersection. Denote by D(n,s,k)D(n,s,k) the maximum cardinality of such a family. a) Find D(n,s,4)D(n,s,4). b) Find D(n,s,3)D(n,s,3).