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

On an extremal problem concerning the theory of graphs

โœ Scribed by Chong-Yun Chao


Book ID
112501366
Publisher
Springer
Year
1981
Tongue
English
Weight
276 KB
Volume
37
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An extremal problem in graph theory
โœ A. Ramachandra Rao ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› The Hebrew University Magnes Press ๐ŸŒ English โš– 230 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