On the Orchard crossing number of complete bipartite graphs
Combinatorics
2010-08-17 v1 Discrete Mathematics
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}.
Cite
@article{arxiv.1008.2638,
title = {On the Orchard crossing number of complete bipartite graphs},
author = {Elie Feder and David Garber},
journal= {arXiv preprint arXiv:1008.2638},
year = {2010}
}
Comments
23 pages, 4 figures; Submitted