Thrackle

A thrackle is an embedding of a graph in the plane, such that each edge is a Jordan arc
and every pair of edges meet exactly once. Edges may either meet at a common endpoint, or, if they have no endpoints in common, at a point in their interiors. In the latter case, the crossing must be ''transverse''.. A preliminary version of these results was reviewed in .

Linear thrackles

A linear thrackle is a thrackle drawn in such a way that its edges are straight line segments. As Paul Erdős observed, every linear thrackle has at most as many edges as vertices. If a vertex ''v'' is connected to three or more edges ''vw'', ''vx'', and ''vy'', at least one of those edges (say ''vw'') lies on a line that separates two other edges. Then, ''w'' must have degree one, because no line segment ending at ''w'', other than ''vw'', can touch both ''vx'' and ''vy''. Removing ''w'' and ''vw'' produces a smaller thrackle, without changing the difference between the numbers of edges and vertices. After removals like this lead to a thrackle in which every vertex has at most two neighbors, by the handshaking lemma the number of edges is at most the number of vertices.. Based on Erdős' proof, one can infer that every linear thrackle is a pseudoforest. Every cycle of odd length may be arranged to form a linear thrackle, but this is not possible for an even-length cycle, because if one edge of the cycle is chosen arbitrarily then the other cycle vertices must lie alternatingly on opposite sides of the line through this edge.

Micha Perles provided another simple proof that linear thrackles have at most ''n'' edges, based on the fact that in a linear thrackle every edge has an endpoint at which the edges span an angle of at most 180°, and for which it is the most clockwise edge within this span. For, if not, there would be two edges, incident to opposite endpoints of the edge and lying on opposite sides of the line through the edge, which could not cross each other. But each vertex can only have this property with respect to a single edge, so the number of edges is at most equal to the number of vertices.

As Erdős also observed, the set of pairs of points realizing the diameter of a point set must form a linear thrackle: no two diameters can be disjoint from each other, because if they were then their four endpoints would have a pair at farther distance apart than the two disjoint edges. For this reason, every set of ''n'' points in the plane can have at most ''n'' diametral pairs, answering a question posed in 1934 by Heinz Hopf and Erika Pannwitz. Andrew Vázsonyi conjectured bounds on the number of diameter pairs in higher dimensions, generalizing this problem.

In computational geometry, the method of rotating calipers can be used to form a linear thrackle from any set of points in convex position, by connecting pairs of points that support parallel lines tangent to the convex hull of the points. This graph contains as a subgraph the thrackle of diameter pairs.

The diameters of the Reinhardt polygons form linear thrackles. An enumeration of linear thrackles may be used to solve the biggest little polygon problem, of finding an ''n''-gon with maximum area relative to its diameter..

Thrackle conjecture

John H. Conway conjectured that, in any thrackle, the number of edges is at most equal to the number of vertices. Conway himself used the terminology ''paths'' and ''spots'' (for ''edges'' and ''vertices'' respectively), so Conway's thrackle conjecture was originally stated
in the form ''every thrackle has at least as many spots as paths.'' Conway offered a $1000 prize for proving or disproving this conjecture, as part of a set of prize problems also including Conway's 99-graph problem, the minimum spacing of Danzer sets, and the winner of Sylver coinage after the move 16.

Equivalently, the thrackle conjecture may be stated as ''every thrackle is a pseudoforest.'' More specifically, if the thrackle conjecture is true, the thrackles may be exactly characterized by a result of Woodall: they are the pseudoforests in which there is no cycle of length four and at most one odd cycle..

It has been proven that every cycle graph other than C₄ has a thrackle embedding, which shows that the conjecture is sharp. That is, there are thrackles having the same number of spots as paths. At the other extreme, the worst-case scenario is that the number of spots is twice the number of paths; this is also attainable.

The thrackle conjecture is known to be true for thrackles drawn in such a way that every edge is an ''x''-monotone curve, crossed at most once by every vertical line..

Known bounds

proved that every bipartite thrackle is a planar graph, although not drawn in a planar way. As a consequence, they show that every thrackleable graph with ''n'' vertices has at most 2''n'' − 3 edges. Since then, this bound has been improved several times. First, it was improved to 3(''n'' − 1)/2,. and another improvement led to a bound of roughly 1.428''n''.. Moreover, the method used to prove the latter result yields for any ε > 0 a finite algorithm that either
improves the bound to (1 + Îµ)''n'' or disproves the conjecture. The current record is due to , who proved a bound of 1.3984''n''..

If the conjecture is false, a minimal counterexample would have the form of two even cycles sharing a vertex. Therefore, to prove the conjecture, it would suffice to prove that graphs of this type cannot be drawn as thrackles.

References

{{reflist

External links

thrackle.org
€”website about the problem

Conjectures
Topological graph theory
Geometric intersection