## 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)/(__
✦ LIBER ✦
A generalization of a theorem of Turán
✍ Scribed by N. Sauer
- Publisher
- Elsevier Science
- Year
- 1971
- Tongue
- English
- Weight
- 136 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A generalization of Turán's theorem
✍
Benny Sudakov; Tibor Szabó; H. Van Vu
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 94 KB
A generalization of Turán's theorem
✍
G. N. Kopylov
📂
Article
📅
1979
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 394 KB
A weighted generalization of Tur�n's the
✍
Bondy, J. A.; Tuza, Zs.
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 114 KB
👁 2 views
We obtain a generalization of Turán's theorem for graphs whose edges are assigned integer weights. We also characterize the extremal graphs in certain cases.
A turán-type theorem on chords of a conv
✍
Vasilis Capoyleas; János Pach
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 387 KB
A weighted Turán sieve method
✍
Yu-Ru Liu; M. Ram Murty
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 185 KB
We develop a weighted Turán sieve method and applied it to study the number of distinct prime divisors of f (p) where p is a prime and f (x) a polynomial with integer coefficients.
A generalization of a Hardy theorem
✍
Bruno de Malafosse; Vladimir Rakočević
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 159 KB