{
  "abstract": "We show that every 3-connected $K_{2,ℓ}$-minor free graph with minimum degree at least 4 has maximum degree at most 7ℓ. As a consequence, we show that every 3-connected $K_{2,ℓ}$-minor free graph with minimum degree at least 5 and no twins of degree 5 has bounded size. Our proofs use Steiner trees and nested cuts; in particular, they do not rely on Ding's characterization of $K_{2,ℓ}$-minor free graphs.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 3,
  "authors": [
    {
      "name": "Nicolas Bousquet"
    },
    {
      "name": "Théo Pierron"
    },
    {
      "name": "Alexandra Wesolek"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/3j7efns9dr8cj.bib",
  "cited_by": 0,
  "doi": "10.1016/j.disc.2024.114005",
  "fulltext_url": null,
  "id": "3j7efns9dr8cj",
  "issns": [
    "0012-365X"
  ],
  "landing_url": "https://hal.science/hal-05745824v1",
  "language": "en",
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.info"
    ],
    [
      "hal",
      "0.math"
    ],
    [
      "hal",
      "1.info.info-dm"
    ],
    [
      "hal",
      "1.math.math-co"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7213544709",
  "pdf_url": "https://hal.science/hal-05745824/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-10",
  "publisher": "Elsevier",
  "ris": "https://research.draconitic.com/paper/3j7efns9dr8cj.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:33Z",
      "native_id": "hal-05745824",
      "source": "hal",
      "url": "https://hal.science/hal-05745824v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:1.math.math-co",
      "subfield": "combinatorics"
    }
  ],
  "title": "A note on highly connected $K_{2,ℓ}$ -minor free graphs",
  "title_text": "A note on highly connected K_2,ℓ -minor free graphs",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:17:33Z",
  "url": "https://research.draconitic.com/paper/3j7efns9dr8cj",
  "venue": "Discrete Mathematics",
  "versions": []
}