Tree-independence number VII. Excluding a star
arXiv:2512.23887
Abstract
We prove that for every fixed integer and every planar graph , the class of -induced-minor-free and -induced-subgraph-free graphs has polylogarithmic tree-independence number. This is a weakening of a conjecture of Dallard, Krnc, Kwon, MilaniÄ, Munaro, Å torgel, and Wiederrecht.