{
  "id": "1702.01355",
  "version": "v1",
  "published": "2017-02-05T00:38:24.000Z",
  "updated": "2017-02-05T00:38:24.000Z",
  "title": "Graphs without large $K_{2,n}$-minors",
  "authors": [
    "Guoli Ding"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-02-05T00:38:24.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "sufficiently large",
      "minimum degree",
      "sufficiently high degree",
      "characterize graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}