Author:
BUKH BORIS,HUBARD ALFREDO
Abstract
We define a variant of the crossing number for an embedding of a graphGinto ℝ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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference26 articles.
1. A Positive Fraction Erdos - Szekeres Theorem
2. The crossing number of a cubic plane polyhedral map plus an edge;Riskin;Studia Sci. Math. Hungar.,1996
3. [12] Fox J. , Gromov M. , Lafforgue V. , Naor A. and Pach J. (2010) Overlap properties of geometric expanders. J. Reine Angew. Math., to appear. arXiv:1005.1392
4. A general approach to d-dimensional geometric queries
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献