2000 character limit reached
Space crossing numbers (1102.1275v2)
Published 7 Feb 2011 in math.CO
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 sharp bounds on the space crossing numbers of pseudo-random graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.