Abstract
This paper contains a proof of the following result: ifn≧(t+1)(k−t−1), then any family ofk-subsets of ann-set with the property that any two of the subsets meet in at leastt points contains at most\(\left( {\begin{array}{*{20}c} {n - t} \\ {k - t} \\ \end{array} } \right)\) subsets. (By a theorem of P. Frankl, this was known whent≧15.) The bound (t+1)(k-t-1) represents the best possible strengthening of the original 1961 theorem of Erdös, Ko, and Rado which reaches the same conclusion under the hypothesisn≧t+(k−t)\(\left( {\begin{array}{*{20}c} k \\ t \\ \end{array} } \right)^3 \). Our proof is linear algebraic in nature; it may be considered as an application of Delsarte’s linear programming bound, but somewhat lengthy calculations are required to reach the stated result. (A. Schrijver has previously noticed the relevance of these methods.) Our exposition is self-contained.
Similar content being viewed by others
References
P. Delsarte, An algebraic approach to the association schemes of coding theory,Philips Res. Reports Suppl. 10 (1973).
P. Erdös, C. Ko, andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2)12 (1961), 313–320.
P. Frankl, The Erdös-Ko-Rado theorem is true forn=ckt, in:Combinatorics, Proc. Fifth Hungarian Coll. Combinatorics, Keszthely, 1976, North-Holland, Amsterdam, 1978, 365–375.
J. E. Graver andW. B. Jurkat, The module structure of integral designs,J. Combinat. Th. (A) 15 (1973), 75–90.
W. Haemers, Eigenvalue methods, in:Packing and Covering in Combinatories (A. Schrijver, ed.). Tract106, Mathematical Centre, Amsterdam 1979.
L. Lovász, On the Shannon capacity of a graph,IEEE Trans. Inform. Theory 25 (1979), 1–7.
F. J. MacWilliams andN. J. A. Sloane,The theory of error-correcting codes, North-Holland, Amsterdam, 1977.
A. Schrijver, Association schemes and the Shannon capacity: Eberlein polynomials and the Erdös-Ko-Rado Theorem,in: Algebraic Methods in Graph Theory, Proc. Sixth Hungarian Coll. Combinatorics, Szeged, 1978, Colloquia Mathematica Societatis János Bolyai, 671–688.
R. M. Wilson, The necessary conditions fort-designs are sufficient for something,Utilitas Mathematica 4 (1973), 207–215.
Author information
Authors and Affiliations
Additional information
This work supported in part by NSF Grant MSC-8217596.