𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Erdős–Ko–Rado theorems for permutations and set partitions

✍ Scribed by Cheng Yeaw Ku; David Renshaw


Book ID
108167237
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
159 KB
Volume
115
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Erdős-Ko-Rado theorems of labeled sets
✍ Xing-bo Geng; Yu-shuang Li 📂 Article 📅 2011 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 186 KB
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