✦ LIBER ✦

An extremal problem in subconnectivity

✍ Scribed by F. T. Boesch; J. A. M. McHugh

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 186 KB
Volume: 34
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198710)34:5<683::aid-nav3220340508>3.0.co;2-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal eigenvalue problem

✍ T. J. Mahar; B. E. Willner 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

An extremal problem for paths in biparti

An extremal problem for paths in bipartite graphs

✍ A. Gyárfás; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

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 for subdivisions ofK

An extremal problem for subdivisions ofK?5

✍ Mader, W. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

It is proved that every graph G with G ≥ 2|G| -5, |G| ≥ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.

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

✍ 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