Induced minors and subpolynomial treewidth (2512.18835v1)

Abstract: Given a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-induced-minor-free if no induced minor of $G$ is isomorphic to a member of $\mathcal{H}$, We denote by $W_{t\times t}$ the $t$-by-$t$ hexagonal grid, and by $K_{t,t}$ the complete bipartite graph with both sides of the bipartition of size $t$. We show that the class of ${K_{t,t},W_{t\times t}}$-induced minor-free graphs with bounded clique number has subpolynomial treewidth. Specifically, we prove that for every integer $t$ there exist $ε\in (0,1]$ and $c \in \nat$ such that every $n$-vertex ${K_{t,t},W_{t\times t}}$-induced minor-free graph with no clique of size $t$ has treewidth at most $2^{c\log^{1-ε}n}$.