Product structure of graph classes with bounded treewidth
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, and Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie, Illingworth, Youri Tamitegama, Jane Tan, David R. Wood

TL;DR
This paper characterizes how many graphs with bounded treewidth can be represented as subgraphs of products of smaller treewidth graphs and complete graphs, providing new structural insights for various graph classes.
Contribution
It introduces the concept of underlying treewidth, relates it to graph minors, and characterizes classes with bounded underlying treewidth based on excluded minors and subgraphs.
Findings
Planar graphs have underlying treewidth 3.
K_{s,t}-minor-free graphs have underlying treewidth s.
Graphs excluding certain subgraphs have bounded underlying treewidth.
Abstract
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class to be the minimum non-negative integer such that, for some function , for every graph there is a graph with such that is isomorphic to a subgraph of . We introduce disjointed coverings of graphs and show they determine the underlying treewidth of any graph class. Using this result, we prove that the class of planar graphs has underlying treewidth 3; the class of -minor-free graphs has underlying treewidth (for ); and the class of -minor-free graphs has underlying treewidth . In general, we prove that a…
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 · Limits and Structures in Graph Theory · Graph theory and applications
