✦ LIBER ✦

Proofs from THE BOOK || Turán’s graph theorem

✍ Scribed by Aigner, Martin; Ziegler, Günter M.

Book ID: 120305712
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 531 KB
Category: Article
ISBN: 3642008569
DOI: 10.1007/978-3-642-00856-6_36

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

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

Proofs from THE BOOK || Cauchy’s rigidit

Proofs from THE BOOK || Cauchy’s rigidity theorem

✍ Aigner, Martin; Ziegler, Günter M. 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 411 KB