Large-Treewidth Graph Decompositions and Applications
Chandra Chekuri, Julia Chuzhoy

TL;DR
This paper investigates how to decompose graphs into subgraphs with large treewidth, establishing tradeoffs between the number of subgraphs and their treewidth, and applying these results to improve algorithms and theoretical bounds.
Contribution
It introduces new theorems on graph decompositions with large treewidth and demonstrates their application in improving algorithmic and structural results.
Findings
Decomposition theorems relating number of subgraphs and treewidth bounds
Framework to bypass the Grid-Minor Theorem in applications
Improved parameters for Erdos-Posa-type results and FPT algorithms
Abstract
Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph into node-disjoint subgraphs, where each subgraph has sufficiently large treewidth. We prove two theorems on the tradeoff between the number of the desired subgraphs , and the desired lower bound on the treewidth of each subgraph. The theorems assert that, given a graph with treewidth , a decomposition with parameters is feasible whenever , or holds. We then show a framework for using these theorems to bypass the well-known Grid-Minor Theorem of Robertson and Seymour in some applications. In particular, this leads to substantially improved parameters in some Erdos-Posa-type results, and faster algorithms for a class of fixed-parameter tractable problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory
