✦ LIBER ✦

Turán's theorem for pseudo-random graphs

✍ Scribed by Yoshiharu Kohayakawa; Vojtěch Rödl; Mathias Schacht; Papa Sissokho; Jozef Skokan

Book ID: 108167199
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 286 KB
Volume: 114
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2006.08.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Turán's theorem for k-graphs

✍ Joel Spencer 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 288 KB

On Turán’s theorem for sparse graphs

✍ M. Ajtai; P. Erdős; J. Komlós; E. Szemerédi 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 200 KB

Turán's theorem and k-connected graphs

✍ Nicolas Bougard; Gwenaël Joret 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The minimum size of a __k__‐connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán's Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Val

Extensions of Turán's theorem on graphs

✍ G. Dirac 📂 Article 📅 1963 🏛 Akadmiai Kiad 🌐 English ⚖ 391 KB

Turán theorems and convexity invariants

Turán theorems and convexity invariants for directed graphs

✍ Robert E. Jamison; Beth Novick 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Turán’s theorem inverted

✍ Vladimir Nikiforov 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 414 KB