1 problem

Strong dichotomy conjecture. For every graph $H$, the ${\sc H\text{-}Cover}$ problem is either polynomial-time solvable for arbitrary input graphs, or it is NP-complete for simple…