V\'aclav Bla\v{z}ej

Forbidden Bicliques Bound Tree-Independence in P5-Free Graphs

A decomposition-repair proof establishes a $4\ell-4$ bag-independence bound when induced $P_5$ paths and $K_{\ell,\ell}$ bicliques are excluded.