Space crossing numbers
arXiv:1102.1275
Abstract
We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs.
16 pages, 3 figures, minor embellishments