✦ LIBER ✦

Extensions of Turán's theorem on graphs

✍ Scribed by G. Dirac

Publisher: Akadmiai Kiad
Year: 1963
Tongue: English
Weight: 391 KB
Volume: 14
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01895726

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

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

On Turán's first main theorem

✍ N. G. De Bruijn 📂 Article 📅 1960 🏛 Akadmiai Kiad 🌐 English ⚖ 161 KB

Extension of Turán's Theorem to the 2-St

Extension of Turán's Theorem to the 2-Stability Number

✍ Michael U. Gerber; Pierre Hansen; Alain Hertz 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 152 KB

A generalization of Turán's theorem

✍ Benny Sudakov; Tibor Szabó; H. Van Vu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__

A generalization of Turán's theorem

✍ G. N. Kopylov 📂 Article 📅 1979 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 394 KB