𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An extremal problem in geodetic graphs

✍ Scribed by K.R. Parthasarathy; N. Srinivasan

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
365 KB
Volume
49
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ 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 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

An extremal problem for H-linked graphs
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

Another extremal problem for Turan graph
Another extremal problem for Turan graphs
✍ Bruce Hedman πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 207 KB

We consider only finite, undirected graphs without loops or multiple edges. A clique of a graph G is a maximal complete subgraph of G. The clique number w(G) is the number of vertices in the largest clique of G. This note addresses the foflowing question: Which graphs G on n vertices with w(G) = r h