The purpose of this paper is to characterize graphs that do not have a large K2,n-minor. As corollaries, it is proved that, for any given positive integer n, every sufficiently large 3-connected graph with minimum degree at least six, every 4-connected graph with a vertex of sufficiently high degree, and every sufficiently large 5-connected graph must have a K2,n-minor.
@article{arxiv.1702.01355,
title = {Graphs without large $K_{2,n}$-minors},
author = {Guoli Ding},
journal= {arXiv preprint arXiv:1702.01355},
year = {2017}
}