2 problems

Let $G$ be a graph. Call $G$ intrinsically knotted if every classical spatial embedding of $G$ contains a non-trivial knot, and call it intrinsically virtually knotted of degree 1…

Let $G$ be a bipartite graph with at least five vertices in each part. Write $v(G)=|V(G)|$ for its number of vertices and $e(G)=|E(G)|$ for its number of edges. Intrinsic-knotting…