Space crossing numbers
Boris Bukh, Alfredo Hubard · 2011
We define the crossing number for an embedding of a graph G into R3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give the sharp bounds on the space crossing numbers of pseudo-random graphs