Tree independence number III. Thetas, prisms and stars

We prove that for every $t\in \mathbb{N}$, there exists $\tau =\tau (t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $\tau$ (where we allow “prisms” to have one path of length zero).