On the Orchard crossing number of complete bipartite graphs
Elie Feder, David Garber
TL;DR
This paper calculates the Orchard crossing number for complete bipartite graphs K_{n,n}, providing insights into their geometric crossing properties similar to the rectilinear crossing number.
Contribution
It introduces the computation of the Orchard crossing number specifically for K_{n,n}, a problem not previously addressed in detail.
Findings
Exact Orchard crossing number for K_{n,n} derived
Comparison with rectilinear crossing number discussed
New methods for crossing number calculation proposed
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}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Limits and Structures in Graph Theory