2 problems

Finite-forbidden-subgraph conjecture. The class $X_M$ is at most factorial if and only if $M$ contains a forest and the bipartite complement of a forest.

Forest boundary conjecture. For any tree $T$, the class of $\{T,\overline{T^b}\}$-free bipartite graphs is at most factorial.