Spherical Thrackles
Grant Cairns, Timothy J.Koussas, and Yuri Nikolayevsky
TL;DR
This paper proves Conway's thrackle conjecture for spherical thrackles, demonstrating that in drawings on a sphere with edges as great circle arcs, the maximum number of edges is bounded by the number of vertices.
Contribution
The paper extends the thrackle conjecture to spherical drawings, providing a proof specific to the case of great circle arcs on a sphere.
Findings
Proof of Conway's thrackle conjecture for spherical thrackles
Bound on edges in spherical thrackle drawings
Extension of thrackle theory to spherical geometry
Abstract
We establish Conway's thrackle conjecture in the case of spherical thrackles; that is, for drawings on the unit sphere where the edges are arcs of great circles.
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
TopicsAdvanced Numerical Analysis Techniques · Computational Geometry and Mesh Generation · Digital Image Processing Techniques