Space crossing numbers

Authors:
Boris Bukh;Alfredo Hubard
Affiliations:
University of Cambridge, Cambridge, United Kingdom;New York University, New York, NY, USA
Venue:
Proceedings of the twenty-seventh annual symposium on Computational geometry
Year:
2011

Citing 6
Cited 1

A general approach to d-dimensional geometric queries

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Bounds for rectilinear crossing numbers

Journal of Graph Theory
On Range Searching with Semialgebraic Sets

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Crossing Numbers and Hard Erdös Problems in Discrete Geometry

Combinatorics, Probability and Computing
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals

Discrete & Computational Geometry

Homogeneous selections from hyperplanes

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

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