Extending the Erdős–Ko–Rado theorem
✍
Norihide Tokushige
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 75 KB
## Abstract Let ${\cal F}$ be a __k__‐uniform hypergraph on __n__ vertices. Suppose that $|F\_{1}\cap \cdots \cap F\_{r}|\ge t$ holds for all $F\_{1},\ldots ,F\_{r}\in {\cal F}$. We prove that the size of ${\cal F}$ is at most ${{n-t}\choose {k-t}}$ if $p= {k \over n}$ satisfies and __n__ is suffi