Meng-Yuan Niu

Sim-Width, Induced Matching Treewidth, and Tree-Independence Number in Induced $K_{t,t}$-Free Graphs

The tree-independence number $tree\text{-}\alpha(G)$, the induced matching treewidth $tree\text{-}\mu(G)$, and the sim-width $simw(G)$ are graph parameters defined in terms of tree or branch decompositions. We establish two polynomial bounds for the tree-independence number of induced $K_{t,t}$-free graphs, one in term...