1 problem

For every graph $H$, consider the problem $\textsc{H-Cover}$ of deciding whether an input graph covers $H$. Strong Dichotomy Conjecture. For every graph $H$, the problem…