{
  "abstract": "One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to~$H$ have treewidth at most $f(H)$. The best bound known for an arbitrary planar $H$ is ${O(|V(H)|^9\\operatorname{poly~log}|V(H)|)}$. We show that if $H$ is the disjoint union of cycles, then $f(H)$ is $O(|V(H)|\\log^2 |V(H)|)$, which is a $\\log|V(H)|$ factor away from being optimal.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 4,
  "authors": [
    {
      "name": "Meike Hatzel"
    },
    {
      "name": "Chun-Hung Liu"
    },
    {
      "name": "Bruce Reed"
    },
    {
      "name": "Sebastian Wiederrecht"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/4htkpzzh2km68.bib",
  "cited_by": 0,
  "doi": "10.37236/13735",
  "fulltext_url": null,
  "id": "4htkpzzh2km68",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p8",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W4406093030",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p8/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/4htkpzzh2km68.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/13735",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p8"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "issn:1077-8926",
      "subfield": "combinatorics"
    }
  ],
  "title": "Bounds on Treewidth via Excluding Disjoint Unions of Cycles",
  "title_text": "Bounds on Treewidth via Excluding Disjoint Unions of Cycles",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/4htkpzzh2km68",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}