Combinatorica

, Volume 4, Issue 2–3, pp 247–257

The exact bound in the Erdös-Ko-Rado theorem

  • Richard M. Wilson
Article

Abstract

This paper contains a proof of the following result: ifn≧(t+1)(kt−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 hypothesisnt+(kt)\(\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.

AMS subject classification (1980)

05 C 35 05 C 65 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Delsarte, An algebraic approach to the association schemes of coding theory,Philips Res. Reports Suppl. 10 (1973).Google Scholar
  2. [2]
    P. Erdös, C. Ko, andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2)12 (1961), 313–320.MATHCrossRefGoogle Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    J. E. Graver andW. B. Jurkat, The module structure of integral designs,J. Combinat. Th. (A) 15 (1973), 75–90.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    W. Haemers, Eigenvalue methods, in:Packing and Covering in Combinatories (A. Schrijver, ed.). Tract106, Mathematical Centre, Amsterdam 1979.Google Scholar
  6. [6]
    L. Lovász, On the Shannon capacity of a graph,IEEE Trans. Inform. Theory 25 (1979), 1–7.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    F. J. MacWilliams andN. J. A. Sloane,The theory of error-correcting codes, North-Holland, Amsterdam, 1977.MATHGoogle Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    R. M. Wilson, The necessary conditions fort-designs are sufficient for something,Utilitas Mathematica 4 (1973), 207–215.MATHMathSciNetGoogle Scholar

Copyright information

© Akadémiai Kiadó 1984

Authors and Affiliations

  • Richard M. Wilson
    • 1
  1. 1.Department of MathematicsCalifornia Institute of TechnologyPasadena

Personalised recommendations