2 problems

Let $H$ be a fixed bipartite graph. For positive integers $n,m$, let $N_{\mathrm{bip}}(n,m,H)$ be the maximum number of unlabelled copies of $H$ over bipartite graphs $G$ with…

Induced-subgraph counting hardness conjecture. Then $\#{\textsc{IndSub}}(\Phi)$ is $\#{\mathsf{W[1]}}$-hard.