✦ LIBER ✦

On an extremal problem of Fejér

✍ Scribed by Tai-Shing Lau; W.J Studden

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 453 KB
Volume: 53
Category: Article
ISSN: 0021-9045
DOI: 10.1016/0021-9045(88)90065-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A contribution to the problem of L. Fejé

A contribution to the problem of L. Fejér on Hermite-Fejér interpolation

✍ A.K Varma; J Prasad 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 361 KB

An extremal coloring problem on matrices

✍ Hans-Dietrich O.F Gronau; Roger Labahn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

An extremal eigenvalue problem

✍ T. J. Mahar; B. E. Willner 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

An extremal problem on the connectivity

An extremal problem on the connectivity of graphs

✍ Qi-Mei He 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

An extremal problem on Kr-free graphs

✍ Peter Frankl; János Pach 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

Let r, t 2 2 be integers and c a constant, 0 < c 5 ( r -2 ) / ( r -1). Suppose that G is a &-free graph on n vertices in which any t distinct vertices have at most cn common neighbors. Here an asymptotically best bound is obtained for the maximal number of edges in such graphs. This solves a problem

On an Extremal Problem for Colored Trees

✍ P. Valtr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Let T be a tree such that there is a proper n-coloring c of the vertices of T which, besides a technical condition, is a k b k a k -free, i.e., T contains no subdivision of a path u 1 , . . . , Then T has O(kn) vertices. (The technical condition requires that T contains no subdivision of a properly