Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity

We prove that for every positive integer $d$ and forest $F$, the class of intersection graphs of axis-aligned boxes in ${\mathbb{R}}^d$ with no induced $F$ subgraph is (polynomially) $\chi$-bounded.