1 problem

Let $G$ be a graph. A linkless embedding of $G$ in $\mathbb{R}^3$ is an embedding in which no two disjoint cycles are linked, and a linear linkless embedding is such an embedding i…