✦ LIBER ✦

On Turán’s theorem for sparse graphs

✍ Scribed by M. Ajtai; P. Erdős; J. Komlós; E. Szemerédi

Book ID: 110564489
Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 200 KB
Volume: 1
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579451

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

Extensions of Turán's theorem on graphs

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

Turán's theorem for pseudo-random graphs

✍ Yoshiharu Kohayakawa; Vojtěch Rödl; Mathias Schacht; Papa Sissokho; Jozef Skokan 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 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

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