Excluding a clique or a biclique in graphs of bounded induced matching treewidth

Tara Abrishami, Marcin Briański, Jadwiga Czyżewska +4

For a tree decomposition $\mathcal{T}$ of a graph $G$, let $\mu (\mathcal{T})$ denote the maximum size of an induced matching in $G$ with the property that some bag of $\mathcal{T}$ c…