3 problems

Kanté–Kwon conjecture. For every tree $T$, the class of $T$-vertex-minor-free graphs has bounded linear rank-width.

CMSO₂ meta-theorem. For every fixed $k,r$ and a $\mathsf{CMSO}_2$ formula $\psi$, the $(r,\psi)$-textsc{MWIS} problem can be solved in polynomial time for graphs with induced match…

Let $\mathcal C$ be a class of graphs of bounded stretch-width. For an $n$-vertex graph $G\in\mathcal C$, let the clique-width of $G$ be the minimum number of labels needed to cons…