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
An extremal problem on the connectivity of graphs
β Scribed by Qi-Mei He
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 401 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We introduce the notion of __H__βlinked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,β¦,__w__~m~. A graph __G__ is __H__β__linked__ if for every choice of vertices Ο ~1~,β¦, Ο ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that Ο ~i~ is the branch vertex
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