The complete nontrivial-intersection theorem for systems of finite sets (Q1924241)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complete nontrivial-intersection theorem for systems of finite sets |
scientific article; zbMATH DE number 934995
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complete nontrivial-intersection theorem for systems of finite sets |
scientific article; zbMATH DE number 934995 |
Statements
The complete nontrivial-intersection theorem for systems of finite sets (English)
0 references
14 October 1996
0 references
Extending earlier results of \textit{P. Frankl} [On intersecting families of finite sets, J. Comb. Theory, Ser. A 24, 146-161 (1978; Zbl 0384.05002)] the maximum cardinality of \(k\)-element subsets of an \(n\)-element set with pairwise intersection of size at least \(t\) is determined if it is nontrivial, i.e., the intersection of all sets has less than \(t\) elements.
0 references
intersection theorem
0 references
intersecting families
0 references
0.98537636
0 references
0.96386087
0 references
0 references
0.95344245
0 references
0.93238217
0 references
0 references
0.92737406
0 references
0.9253491
0 references
0.90927356
0 references
