Induced subgraphs and tree decompositions XIX. Thetas and forests

Let $H$ be a graph and let $\mathcal{C}$ be a hereditary class of theta-free graphs such that $H\mathrm{\notin }\mathcal{C}$. We prove that if (a) $H$ is a forest; and (b) $\mathcal{C}$ excludes the line graphs of all subdivisions of some wall, then the treewidth of every graph in $\mathcal{C}$ is at most a polynomial function of its clique number. This is best possible in that both (a) and (b) are necessary for the existence of $any$ function with the above property.