| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424043 | European Journal of Combinatorics | 2016 | 10 Pages |
Abstract
A well-known theorem of ErdÅs, Ko and Rado implies that any family Ⱡof k-element subsets of an n-element set with more than nâtkât members must contain two members F and Fâ² with |Fâ©Fâ²|1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Frankl, Yoshiharu Kohayakawa, VojtÄch Rödl,