arXiv Analytics

Sign in

arXiv:1008.2638 [math.CO]AbstractReferencesReviewsResources

On the Orchard crossing number of complete bipartite graphs

Elie Feder, David Garber

Published 2010-08-16Version 1

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}.

Comments: 23 pages, 4 figures; Submitted
Categories: math.CO, cs.DM
Subjects: 05C62
Related articles: Most relevant | Search more
arXiv:1408.1155 [math.CO] (Published 2014-08-06)
Interval minors of complete bipartite graphs
arXiv:1309.2927 [math.CO] (Published 2013-09-11, updated 2015-11-11)
The number of $C_{2l}$-free graphs
arXiv:1210.2918 [math.CO] (Published 2012-10-10)
Book drawings of complete bipartite graphs

Links

Toolbox