2 problems

Polynomial-time independent-set conjecture. $\textsc{Maximum Independent Set}$ is solvable in polynomial time in $\mathcal{O}_k$-free graphs.

Let $(\beta,h,\gamma)$ be parameters of the independent set problem, and let an MP-structure consist of a hierarchy $(\zeta,\mathcal V_{\boldsymbol m})$ with $K$ levels. For such a…