LetX be a finite set ofn elements and ℓ a family ofk-subsets ofX. Suppose that for a given setL of non-negative integers all the pairwise intersections of members of ℓ have cardinality belonging toL. Letm(n, k, L) denote the maximum possible cardinality of ℓ. This function was investigated by many authors, but to determine its exact value or even its correct order of magnitude appears to be hopeless. In this paper we investigate the case |L|=3. We give necessary and sufficient conditions form(n, k, L)=O(n) andm(n, k, L)≧O(n2), and show that in some casesm(n, k, L)=O(n3/2), which is quite surprising.
[1]
Peter Frankl,et al.
On Set Intersections
,
1980,
J. Comb. Theory, Ser. A.
[2]
Paul Erdös,et al.
INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS
,
1978
.
[3]
Peter Frankl,et al.
Intersection theorems with geometric consequences
,
1981,
Comb..
[4]
Peter Frankl.
Families of finite sets with prescribed cardinalities for pairwise intersections
,
1980
.
[5]
Richard M. Wilson,et al.
On $t$-designs
,
1975
.
[6]
P. Erdös,et al.
Intersection Theorems for Systems of Sets
,
1960
.