Space crossing numbers
Combinatorics
2011-08-16 v2
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.
Cite
@article{arxiv.1102.1275,
title = {Space crossing numbers},
author = {Boris Bukh and Alfredo Hubard},
journal= {arXiv preprint arXiv:1102.1275},
year = {2011}
}
Comments
16 pages, 3 figures, minor embellishments