๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An extremal coloring problem on matrices

โœ Scribed by Hans-Dietrich O.F Gronau; Roger Labahn

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
201 KB
Volume
61
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On an Extremal Problem for Colored Trees
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

On an extremal problem of Fejรฉr
On an extremal problem of Fejรฉr
โœ Tai-Shing Lau; W.J Studden ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB
An extremal eigenvalue problem
An extremal eigenvalue problem
โœ T. J. Mahar; B. E. Willner ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 436 KB
An extremal problem on Kr-free graphs
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