On Conway's thrackle conjecture (Q1380797)

A thrackle is a graph drawn in the plane with its edges represented by Jordan arcs so that any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. J. H. Conway's thrackle conjecture is that the number of edges of a thrackle is at most the number of its vertices. The present authors show that every thrackleable bipartite graph is planar, and use this result to show that a thrackle having \(n\) vertices has at most \(2n-3\) edges. They also consider some related problems and generalizations.