Add to ORKGBollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense graph minor. In this paper we investigate the ties between small graph minors and linkages. In particular, we show that a 6-connected graph with a K − 9 minor is 3-linked. Further, we show that a 7-connected graph with a K − 9 minor is (2, 5)-linked. Finally, we show that a graph of order n and size at least 7n − 29 contains a K −− 9 minor.
At the core of the seminal Graph Minor Theory of Robert-son and Seymour is a powerful theorem which ...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
Extremal Functions for Graph Linkages and Rooted Minors Paul Wollan 137 pages Directed by:...
AbstractWe prove that for every graph H with the minimum degree δ⩾5, the third iterated line graph L...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractA graph is said to be k-linked if it has at least 2k vertices and for every sequence s1,…,sk...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
For every natural number n, we exhibit a graph with the property that every embedding of it in ℝ3 co...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Mader proved that for every integer t there is a smallest real number c(t) such that any graph with ...
At the core of the seminal Graph Minor Theory of Robert-son and Seymour is a powerful theorem which ...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...
AbstractLet a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) s...
AbstractIt is shown that for any positive integers k and w there exists a constant N=N(k,w) such tha...
Abstract. A fundamental result in structural graph theory states that every graph with large average...
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highl...
Extremal Functions for Graph Linkages and Rooted Minors Paul Wollan 137 pages Directed by:...
AbstractWe prove that for every graph H with the minimum degree δ⩾5, the third iterated line graph L...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
AbstractA graph is said to be k-linked if it has at least 2k vertices and for every sequence s1,…,sk...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
For every natural number n, we exhibit a graph with the property that every embedding of it in ℝ3 co...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Mader proved that for every integer t there is a smallest real number c(t) such that any graph with ...
At the core of the seminal Graph Minor Theory of Robert-son and Seymour is a powerful theorem which ...
AbstractSuppose G is a k-connected graph that does not contain Kk as a minor. What does G look like?...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...