Great-circle tree thrackles
From MaRDI portal
Abstract: A thrackle is a graph drawing in which every pair of edges meets exactly once. The Thrackle Conjecture (established by John Conway) states that the number of edges of a thrackle cannot exceed the number of its vertices. Cairns, Koussas, and Nikolayevsky (2015) prove that the Thrackle Conjecture holds for great-circle thrackles drawn on the sphere. They also posit that the Thrackle Conjecture can be restated to say that a graph can be drawn as a thrackle drawing in the plane if and only if it admits a great-circle thrackle drawing. We demonstrate that the class of great-circle thrackleable graphs excludes some trees. Thus the informal conjecture from Cairns, Koussas, and Nikolayevsky (2015) is not equivalent to the Thrackle Conjecture.
Recommendations
Cites work
- A computational approach to Conway's thrackle conjecture
- A new upper bound for Conway's thrackles
- Great-circle spherical thrackles
- scientific article; zbMATH DE number 3336750 (Why is no real title available?)
- On Sets of Distances of n Points
- On the bounds of Conway's thrackles
- Thrackles: an improved upper bound
Cited in
(3)
This page was built for publication: Great-circle tree thrackles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2092339)