✦ LIBER ✦

A general induction theorem for rearrangements of n-tuples

✍ Scribed by Kong-Ming Chong

Book ID: 107800418
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 585 KB
Volume: 53
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(76)90121-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A general rearrangement theorem for sequ

A general rearrangement theorem for sequences

✍ Harald Niederreiter 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 267 KB

A stability theorem for general non-Newt

A stability theorem for general non-Newtonian fluid

✍ Kapur, J. N. ;Goel, Shashi 📂 Article 📅 1963 🏛 Springer 🌐 English ⚖ 399 KB

A generalization of a theorem of Turán

✍ N. Sauer 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Generalized n-tuple colorings of a graph

Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton

✍ Abdelkader Khelladi; Charles Payan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A generalization of Turán's theorem

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

A generalization of Turán's theorem

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

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