| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656999 | Journal of Combinatorial Theory, Series B | 2011 | 7 Pages |
Abstract
The recent paper ‘Linear connectivity forces large complete bipartite minors’ by Böhme, Kawarabayashi, Maharry and Mohar relies on an extension of Robertson and Seymourʼs structure theorem for graphs with a forbidden minor. We describe a more direct approach which uses just the original structure theorem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
