Tiling Turán Theorems

Turán theorems with repeated degrees

✍ Michael O. Albertson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 352 KB

The maximum number of edges in a graph with no constant degree clique of a fixed size is determined asymptotically.

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)/(__

Turán's Theorem and Maximal Degrees

✍ Béla Bollobás 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 89 KB

graphs of order n and size at least t r (n) that do not have a vertex x of maximal degree d x whose neighbours span at least t r&1 (d x )+1 edges. Furthermore, we show that, for every graph G of order n and size at least t r (n), the degree-greedy algorithm used by Bondy (1983, J. Combin. Theory Ser

Turán's theorem for k-graphs

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

On Turán's first main theorem

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

A generalization of Turán's theorem

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