BibTeX
@MISC{Bey98theerdős-ko-rado,
author = {Christian Bey},
title = {The Erdős-Ko-Rado Bound Of The Function Lattice},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We answer the following question: When does a k-uniform family generated by some rank t element in the function lattice have maximum size among all k-uniform t-intersecting families?
Citations
| 162 | Intersection theorems for systems of finite sets - Erdős, Ko, et al. - 1961 |
| 43 | The complete intersection theorem for systems of finite sets - Ahlswede, Khachatrian - 1997 |
| 40 | Sperner Theory - Engel - 1997 |
| 30 | Proof techniques in the theory of finite sets - GREENE, KLEITMAN |
| 25 | The exact bound in the Erdős–Ko–Rado theorem - Wilson - 1984 |
| 24 | The Erdős–Ko–Rado theorem is true for n = ckt - Frankl - 1978 |
| 23 | The shifting technique in extremal set theory - Frankl - 1987 |
| 20 | Erdos-Ko-Rado theorem -- 22 years later - Deza, Frankl - 1983 |
| 19 | On a combinatorial conjecture of erdös - Kleitman - 1966 |
| 11 | The diametric theorem in Hamming spaces — optimal anticodes - Ahlswede, Khachatrian - 1998 |
| 4 | Quelques problèmes concernant les cliques des hypergraphes k-complets et q-parti h-complets, Hypergraph Seminar - Meyer - 1972 |
| 2 | An Erdos-Ko-Rado theorem for the subcubes of a cube - Engel - 1984 |
