Tree-independence number and excluding ladder and wheel as an induced minor

 

In this talk, we show that for all positive integers k and d, the class of $K_{1,d}$-free graphs not containing the k-ladder or the k-wheel as an induced minor has a bounded tree-independence number.

Our proof uses a generalization of the concept of brambles to tree-independence number.