48 citations · 91 across the 23 of their papers we have counts for
1 paper · 1 filter
Boris Bukh, Alfredo Hubard
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…