✦ LIBER ✦

A new generalization of the Erdös-Ko-Rado theorem

✍ Scribed by L Pyber

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 274 KB
Volume: 43
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90025-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of the Erdös-Ko-Rado th

A generalization of the Erdös-Ko-Rado theorem on finite set systems

✍ A Hajnal; Bruce Rothschild 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 156 KB

An Erdös-Ko-Rado theorem for multisets

✍ Ian Anderson 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 881 KB

The Erdös-Ko-Rado theorem for vector spa

The Erdös-Ko-Rado theorem for vector spaces

✍ P. Frankl; R.M. Wilson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 357 KB

A simple proof of the Erdös-Chao Ko-Rado

A simple proof of the Erdös-Chao Ko-Rado theorem

✍ G.O.H Katona 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 76 KB

An ordered version of the Erdös-Ko-Rado

An ordered version of the Erdös-Ko-Rado theorem

✍ M.L Livingston 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 227 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