Article contents
Space Crossing Numbers
Published online by Cambridge University Press: 16 March 2012
Abstract
We define a variant of the crossing number for an embedding of a graph G into ℝ3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the rectilinear space crossing numbers of pseudo-random graphs.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
- 3
- Cited by