𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An edge extremal result for subcohesion

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

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
345 KB
Volume
38
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Extremal Result for Subgraphs with Fe
An Extremal Result for Subgraphs with Few Edges
✍ S. Brandt πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 427 KB

We prove that whenever the edge number of a graph of order \(n \geqslant 517\) ensures that it contains every complete graph and every forest with at most \(n\) vertices and at most \(m\) edges, then the graph contains every graph with at most \(n\) vertices and \(m\) edges if \(m<n\). The required

Extremal results for rooted minor proble
Extremal results for rooted minor problems
✍ Leif K JΓΈrgensen; Ken-ichi Kawarabayashi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract In this article, we consider the following problem. Given four distinct vertices __v__~1~,__v__~2~,__v__~3~,__v__~4~. How many edges guarantee the existence of seven connected disjoint subgraphs __X__~i~ for __i__ = 1,…, 7 such that __X__~j~ contains __v__~j~ for __j__ = 1, 2, 3, 4 and

An extremal function for digraph subcont
An extremal function for digraph subcontraction
✍ Jagger, Chris πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 400 KB

We determine, to within a constant factor, the maximum size of a digraph which has no subcontraction to the complete digraph DK, of order p. Let d(p) be defined for positive integers p by d(p) = inf{c; e(D) 2 clDI implies D % DK,}, where D denotes a digraph, and + denotes contraction. We show that 0