Induced-minor-free product structure conjecture
Induced-minor-free product structure conjecture
Let be a graph. For a graph , being -induced-minor-free means that does not contain as an induced minor. Let denote the strong product of graphs and , and let denote the treewidth of .
Induced-minor-free product structure conjecture. There is a function such that every -induced-minor-free graph with maximum degree at most is isomorphic to a subgraph of for some graph with and for some path .
This is proposed as a common strengthening of product-structure results for planar and bounded-degree minor-free graphs. Its resolution is not given in the source.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Robert Hickingbotham, “Induced Minors, Asymptotic Dimension, and Baker's Technique”, arXiv:2508.06190 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.