Ramsey-type theorem for spatial graphs (Q1385300)

The author shows that for every imbedding of a graph \(H\) in \(\mathbb{R}^3\), there exist positive integers \(m\) and \(n\) such that every imbedding of the complete bipartite graph \(K_{m,n}\) in \(\mathbb{R}^3\) whose projection in the \(xy\)-plane consists entirely of straight edges contains a subgraph which is ambient isotopic to \(H\).