Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem

Journal Article

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.

Full Text

Duke Authors

Cited Authors

  • Calderbank, AR; Frankl, P

Published Date

  • January 1, 1992

Published In

Volume / Issue

  • 1 / 2

Start / End Page

  • 115 - 122

Electronic International Standard Serial Number (EISSN)

  • 1469-2163

International Standard Serial Number (ISSN)

  • 0963-5483

Digital Object Identifier (DOI)

  • 10.1017/S0963548300000134

Citation Source

  • Scopus