𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


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

An extremal bandwidth problem for bipart
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 119 KB πŸ‘ 2 views
An extremal problem for H-linked graphs
✍ Alexandr Kostochka; Gexin Yu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 167 KB πŸ‘ 1 views

## 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

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 the connectivity of maximal planar gr
✍ S. L. Hakimi; E. F. Schmeichel πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views