Publications [#331060] of Robert Calderbank

Papers Published

1. Calderbank, AR; Frankl, P, Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem, Combinatorics Probability and Computing, vol. 1 no. 2 (January, 1992), pp. 115-122, Cambridge University Press (CUP) [doi]
   (last updated on 2026/01/15)

   Abstract:
   A family [formula omitted] of k-element sets of an n-set is called t-intersecting if any two of its members overlap in at least t-elements. The Erdős-Ko-Rado Theorem gives a best possible upper bound for such a family if n ≥ n0(k, t). One of the most exciting open cases is when t = 2, n = 2k. The present paper gives an essential improvement on the upper bound for this case. The proofs use linear algebra and yield more general results. © 1992, Cambridge University Press. All rights reserved.