2 problems

Quadratic universal graph conjecture. The minimum number of vertices in a bipartite permutation graph containing all $n$-vertex bipartite permutation graphs is

Induced subgraph isomorphism hardness conjecture. Unless $\mathrm{P}=\mathrm{NP}$, the induced subgraph isomorphism problem is NP-hard in $\mathcal X$ if and only if $\mathcal X$ c…