On the Orchard Crossing Number of the Complete Bipartite Graphs $K_{n,n}$

Elie Feder, David Garber

Abstract


We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs $K_{n,n}$.


Full Text: PDF