Excluding subdivisions of bounded degree graphs

Abstract

Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that contain a subdivision of a (larger) graph $H_1$. Dvořák found a clever strengthening---his structure is not satisfied by graphs that contain a subdivision of a graph $H_2$, where $H_2$ has "similar embedding properties" as $H$. Building upon Dvořák's theorem, we prove that said graphs $G$ satisfy a similar structure theorem. Our structure is not satisfied by graphs that contain a subdivision of a graph $H_3$ that has similar embedding properties as $H$ and has the same maximum degree as $H$. This will be important in a forthcoming application to well-quasi-ordering.

Cited by in corpus (3)

• Clustered Variants of Hajós' Conjecture
• Packing Topological Minors Half-Integrally
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three