✦ LIBER ✦

On the Erdos-Stone Theorem

✍ Scribed by Chvatal, V.; Szemeredi, E.

Book ID: 120095046
Publisher: Oxford University Press
Year: 1981
Tongue: English
Weight: 164 KB
Volume: s2-23
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-23.2.207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extension of the Erdős-Stone theorem

✍ B. Bollobás; Y. Kohayakawa 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 398 KB

Note on the Erdos - Szekeres Theorem

✍ G. Tóth; P. Valtr 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 64 KB

On a Theorem of Erdos

✍ Maly, O. E. 📂 Article 📅 1969 🏛 Oxford University Press 🌐 English ⚖ 174 KB

Remarks on a Theorem of Erdos

✍ Kahane, J.-P. 📂 Article 📅 1967 🏛 Oxford University Press 🌐 English ⚖ 73 KB

On Erdös-Lax theorem

✍ Chan, T N ;Malik, M A 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 95 KB

Proof of a Conjecture of Bollobás and Ko

Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem

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

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .