✦ LIBER ✦

An extension of the Erdős-Stone theorem

✍ Scribed by B. Bollobás; Y. Kohayakawa

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 398 KB
Volume: 14
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01212976

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Common Extension of the Erdős–Stone Th

A Common Extension of the Erdős–Stone Theorem and the Alon–Yuster Theorem for Unbounded Graphs

✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Extensions and consequences of Chvátal-E

Extensions and consequences of Chvátal-Erdős' theorem

✍ J. van den Heuvel 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 396 KB

An Erdős-Gallai Theorem for Matroids

✍ Sean McGuinness 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 312 KB

Tauberian Theorem of Erdős Revisited

✍ J. Korevaar 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

An extension of the Erdős–Neveu–Rényi th

An extension of the Erdős–Neveu–Rényi theorem with applications to order statistics

✍ M. Kaluszka; A. Okolewski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 90 KB

The necessary and su cient conditions are given for some stochastic process to be an empirical distribution function from some exchangeable random variables. The result is applied to establish sharp lower and upper bounds for order statistics based on possibly dependent random variables.

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