Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
Publication
, Journal Article
Calderbank, AR; Frankl, P
Published in: Combinatorics, Probability and Computing
January 1, 1992
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.
Duke Scholars
Published In
Combinatorics, Probability and Computing
DOI
EISSN
1469-2163
ISSN
0963-5483
Publication Date
January 1, 1992
Volume
1
Issue
2
Start / End Page
115 / 122
Related Subject Headings
- Computation Theory & Mathematics
- 49 Mathematical sciences
- 46 Information and computing sciences
- 08 Information and Computing Sciences
- 01 Mathematical Sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., & Frankl, P. (1992). Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem. Combinatorics, Probability and Computing, 1(2), 115–122. https://doi.org/10.1017/S0963548300000134
Calderbank, A. R., and P. Frankl. “Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem.” Combinatorics, Probability and Computing 1, no. 2 (January 1, 1992): 115–22. https://doi.org/10.1017/S0963548300000134.
Calderbank AR, Frankl P. Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem. Combinatorics, Probability and Computing. 1992 Jan 1;1(2):115–22.
Calderbank, A. R., and P. Frankl. “Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem.” Combinatorics, Probability and Computing, vol. 1, no. 2, Jan. 1992, pp. 115–22. Scopus, doi:10.1017/S0963548300000134.
Calderbank AR, Frankl P. Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem. Combinatorics, Probability and Computing. 1992 Jan 1;1(2):115–122.
Published In
Combinatorics, Probability and Computing
DOI
EISSN
1469-2163
ISSN
0963-5483
Publication Date
January 1, 1992
Volume
1
Issue
2
Start / End Page
115 / 122
Related Subject Headings
- Computation Theory & Mathematics
- 49 Mathematical sciences
- 46 Information and computing sciences
- 08 Information and Computing Sciences
- 01 Mathematical Sciences