On the Orchard crossing number of complete bipartite graphs

2010/08/16 by Elie Feder, Feder, Elie, David Garber +1
Computer Science · Mathematics · #05C62 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05C62

paper · pdf · doi:10.48550/arxiv.1008.2638

23 pages, 4 figures; Submitted

arxiv created 2010/08/16 · arxiv updated 2010/08/17

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.

Related

• The Orchard crossing number of an abstract graph
• On the Orchard crossing number of prisms, ladders and other related graphs
• A linear upper bound on the rectilinear crossing number
• A survey of graphs with known or bounded crossing numbers
• On the outerplanar crossing numbers of complete multipartite graphs