Graphs without large K_{2,n}-minors

arXiv1702.01355MaRDI QIDQ6282814FDOQ6282814

Publication date: 4 February 2017

Abstract: The purpose of this paper is to characterize graphs that do not have a large

K_{2, 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

K_{2, n}

-minor.

This page was built for publication: Graphs without large $K_{2,n}$-minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282814)