REVIEW 1 cited by
Product structure of graphs with an excluded minor
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$ and optimal bounds (to within a constant factor) on $m$ in terms of the number of vertices of $G$ and the treewidth of $G$. These results follow from a more general theorem whose corollaries include a strengthening of the celebrated separator theorem of Alon, Seymour, and Thomas [J. Amer. Math. Soc. 1990] and the Planar Graph Product Structure Theorem of Dujmovi\'c et al. [J. ACM 2020].
Forward citations
Cited by 1 Pith paper
-
Short Paths in the Planar Graph Product Structure Theorem
Every n-vertex planar graph is contained in H ⊠ P ⊠ K_c for some planar H of treewidth 3 and a path P of length O((tw(G)+1)^(1-ε) n^ε).
Discussion (0). Continue with ORCID to comment.